KMIN - KMIN

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); it != _e; ++it)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N 50005
int a[N], b[N], p[N], m, n, k;

int main() {
	scanf( "%d%d%d", &m, &n, &k );
	rep(i,m) scanf( "%d", a + i );
	rep(i,n) scanf("%d",b+i); sort(b,b+n);
	priority_queue< ii, vii, greater<ii> > qu;
	rep(i,m) qu.push(ii(a[i]+b[0], i));
	rep(i,k) {
		ii tmp = qu.top(); qu.pop();
		printf( "%d\n", tmp.fi );
		if( p[tmp.se] < n-1 ) 
			qu.push(ii(a[tmp.se]+b[++p[tmp.se]], tmp.se));
	}
	return 0;
}

Download