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>
#define pb push_back
using namespace std;
vector<int> smallest_sums(int N, vector<int> A, vector<int> B) {
priority_queue<int> pq;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
pq.push(A[i]+B[j]);
}
}
vector<int> ans(N);
for (int i = 0; i < N; ++i) {
ans[i] = pq.top();
pq.pop();
}
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... |