# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844181 | 2023-09-05T10:45:12 Z | matan | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KB |
#include <vector> #include <algorithm> std::vector<long long> smallest_sums_efficient(int N, std::vector<int> A, std::vector<int> B) { std::vector<long long> C(N); std::vector<int> CC_index(N, 0); C[0] = A[0] + B[0]; CC_index[0]++; int k = 1; while (k < N) { std::vector<int> temp_vector; for (int l = 0; l < N; l++) { temp_vector.push_back(A[l] + B[CC_index[l]]); } auto min_it = std::min_element(temp_vector.begin(), temp_vector.end()); int min_val = *min_it; int min_idx = (int)std::distance(temp_vector.begin(), min_it); C[k] = min_val; k++; CC_index[min_idx]++; } return C; }