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;
#define pb push_back
#define F first
#define S second
vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
vector<int> ans;
set<pair<int, pair<int, int>>> st;
for(int i=0; i< n; i++){
st.insert({a[i]+b[0], {i, 0}});
}
for(int i=0; i< n; i++){
auto val = *st.begin();
ans.pb(val.F);
st.insert({a[val.S.F]+b[val.S.S+1], {val.S.F, val.S.S+1}});
st.erase(val);
}
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... |