真 他 妈 离 谱

#include <iostream> 
#include <queue>
#define MAXN 100000
#define QWQ cout << "QWQ" << endl;
using namespace std;
int a[MAXN + 10], b[MAXN + 10];
priority_queue <int> que;
int main() {
	int n; cin >> n;
	for(int p = 1; p <= n; p++) cin >> a[p];
	for(int p = 1; p <= n; p++) cin >> b[p];
	for(int p = 1; p <= min(5000, n); p++) {
		for(int i = 1; i <= min(725, n); i++)
			que.push(-(a[p] + b[i]));
	}
	int tot = 0;
	while(!que.empty()) {
		cout << -que.top() << ' ';
		que.pop();
		tot++;
		if(tot == n) break;
	}
}