제출 #1085382

#제출 시각아이디문제언어결과실행 시간메모리
1085382TimoshA Plus B (IOI23_aplusb)C++17
10 / 100
1 ms348 KiB
#include <bits/stdc++.h> #include "aplusb.h" using namespace std; std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) { set<pair<int, pair<int, int>>> st; for (int i = 0; i < N; i++) st.insert({B[i] + A[0], {1, i}}); vector<int> ans; for (int i = 0; i < N; i++) { auto it = st.begin(); st.erase(it); ans.push_back((*it).first); if ((*it).second.first != N) st.insert({(*it).first + B[(*it).second.second] + A[(*it).second.first], {(*it).second.first + 1, (*it).second.second}}); } sort(ans.begin(), ans.end()); 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...