Submission #928629

#TimeUsernameProblemLanguageResultExecution timeMemory
928629AlphaMale06A Plus B (IOI23_aplusb)C++17
100 / 100
82 ms8908 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...