# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896488 | SuPythony | 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 <bits/stdc++.h>
using namespace std;
vector<long long> smallest_sums(int N, vector<long long> A, vector<long long> B) {
vector<long long> ans;
int s=0, a=0, b=0;
while (s<N) {
ans.push_back(A[a]+B[b]);
s++;
if (b==N-1) a++;
else if (a==N-1) b++;
else if (A[a+1]+B[b]<=B[b+1]+A[a]) a++;
else b++;
}
return ans;
}