# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067233 | ChericMAC | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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.top();
C.pop();
}
return result;
}