# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896488 | 2024-01-01T14:31:40 Z | SuPythony | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KB |
#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; }