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 <bits/stdc++.h>
using namespace std;
vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
vector<int> c = {a[0] + b[0]};
int i = 1, j = 1;
while (i + j <= n) {
if (a[i] + b[0] > b[j] + a[0]) c.emplace_back(b[j++] + a[0]);
else c.emplace_back(a[i++] + b[0]);
}
return c;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |