#include "aplusb.h"
#include <bits/stdc++.h>
using namespace std;
using ll = int;
const ll MEM = 1e5 + 4;
vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B)
{
ll l = 0, r = 2e9 + 7;
ll n = N;
while (l <= r)
{
ll mid = (l + r) / 2;
ll o = 0, j = n - 1;
for (int i = 0; i < n; i++)
{
for (; A[i] + B[j] > mid && j >= 0; j--)
;
if (j >= 0)
o += j + 1;
if(o>=n) break;
}
if (o >= n)
r = mid - 1;
else
l = mid + 1;
}
vector<ll> ans(n, 0);
r = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n && A[i] + B[j] < l; j++)
{
ans[r] = (A[i] + B[j]);
r++;
}
}
for (int i = r; i < n; i++)
ans[i] = (l);
sort(ans.begin(), ans.end());
return ans;
}
