# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067234 | 2024-08-20T13:17:46 Z | ChericMAC | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KB |
#include <aplusb.h> #include <vector> #include <algorithm> using namespace std; vector<int> smallest_sums(int N, vector<int> A, vector<int> B) { vector<int> C; for (int i = 0; i < N; i++) { for (int j = 0; j < N - i; j++) { C.push_back(A[j] + B[i]); } } sort(C.begin(), C.end()); vector<int> result(N); for (int i = 0; i < N; i++) { result[i] = C[i] } return result; }