#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
struct elm
{
int inda, indb,sum;
bool operator<(const elm other) const
{
return sum >= other.sum;
}
};
vector<int> smallest_sums(int n, vector<int> a, vector<int> b)
{
vector<int> ans;
priority_queue<elm> q;
rep(i,n)
{
q.push({i,0,a[i]+b[0]});
}
rep(i,n)
{
elm t = q.top();
ans.pb(t.sum);
q.pop();
q.push({t.inda,t.indb+1,a[t.inda]+b[t.indb+1]});
}
return ans;
}
