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<vector>
using namespace std;
vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
vector<int> ans;
int ans_n = 0;
int i = 0, j = 0;
while (ans_n < N) {
ans.push_back(A[i] + B[j]);
ans_n++;
if (A[0] + B[j+1] < A[i+1] + B[0]) {
++j; i = 0;
} else {
++i; j = 0;
}
}
return ans;
}
# | 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... |