#include<bits/stdc++.h>
using namespace std;
priority_queue<long long,vector<long long>,greater<long long> >q;
long long mid=0x7fffffff,n,a[10000000],b[10000000],lit[2]={0x7fffffff,0x7fffffff};
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		lit[0]=min(a[i],lit[0]);
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
		lit[1]=min(b[i],lit[1]);
	}
	for(int i=1;i<=n;i++)
		q.push(lit[0]+b[i]);
	for(int i=1;i<=n;i++)
		q.push(lit[1]+a[i]);
	while(n!=0){
		if(q.top()!=mid){
			n--;
			cout<<q.top()<<" ";
			mid=q.top();
		}
		q.pop();
	}
	return 0;
}

就好奇，样例都过了，怎么还过不了