# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1094314 | Sunbae | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <algorithm>
//#include "aplusb.h"
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
vector<int> smallest_sums(int n, vector<int> A, vector<int> B) {
ll low = A[0] + B[0], high = A[n-1] + B[n-1], ans;
while(low <= high){
ll mid = low + ((high-low)>>1), cnt = 0;
for(int i = 0; i<n; ++i){
cnt += upper_bound(B.begin(), B.end(), mid-A[i]) - B.begin();
}
if(cnt >= n) high = mid-1, ans = mid;
else low = mid+1;
}
vector<int> v(n);
for(int i = 0, m = 0; i<n; ++i){
for(int j = 0; A[i] + B[j] <= ans && j<n; ++j){
v[m++] = A[i] + B[j];
}
}
return v;
}
signed main(){
int n; scanf("%d", &n);
vector<int> A(n), B(n);
for(int i = 0, x; i<n; ++i) scanf("%d", &x), A[i] = x;
for(int i = 0, x; i<n; ++i) scanf("%d", &x), B[i] = x;
vector<int> v = smallest_sums(n, A, B);
for(int x: v) printf("%d ", x);
}