抽象ac代码 求hack/证明

#include <bits/stdc++.h>
#define ll long long

using namespace std;

ll a[100010],b[100010];
priority_queue <int,vector<int>,greater<int> > q;
ll n,m;

int main() {
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    for(int i=1;i<=sqrt(n)*2&&i<=n;i++){
    	for(int j=1;j<=sqrt(n)*2&&j<=n;j++){
    	//	cout<<a[i]<<" "<<b[j]<<endl;
    		q.push(a[i]+b[j]);
		}
	}
	for(int i=1;i<=n;i++){
		cout<<q.top()<<" ";
		q.pop();
	}
    return 0;
}