# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960392 | 2024-04-10T11:18:45 Z | noreason | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long vector<int> smallest_sums(int N, vector<int> A, vector<int> B){ // 1 2 2 3 4 5 5 // 5 6 6 7 8 10 12 int i = 0; int j = 0; int sz = 0; vector<int> ans; while(sz<N and i<N and j<N){ ans.push_back(A[i] + B[j]); sz++; if(A[i] + B[j+1] < A[i+1] + B[j]){ j++; }else if(A[i]+B[j+1]==A[i+1]+B[j]){ i++; ans.push(A[i]+B[j+1]); sz++; }else i++; } return ans; }