# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067230 | 2024-08-20T13:15:16 Z | ChericMAC | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KB |
#include <aplusb.h> #include <queue> #include <algorithm> using namespace std; vector<int> smallest_sums(int N, vector<int> A, vector<int> B) { priority_queue<int, vector<int>, greater<int>> C; for (int i = 0; i < N; i++) { for (int j = 0; j < N - i; j++) { C.push(A[j] + B[i]); } } vector<int> result(N); for (int i = 0; i < N; i++) { result[i] = C.top() C.pop() } return result; }