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<bits/stdc++.h>
using namespace std;
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
vector<int> C(N);
priority_queue<pair<int, pair<int, int>>,vector<pair<int, pair<int, int>>>, greater<pair<int, pair<int, int>>>> q;
for(int i = 0; i < N; i++){
q.push({A[i]+B[0], {i, 0}});
}
for(int i = 0; i < N; i++){
auto x= q.top();
q.pop();
q.push({A[x.second.first]+B[x.second.second+1], {x.second.first, x.second.second+1}});
C[i] = x.first;
}
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... |