Submission #1188224

#TimeUsernameProblemLanguageResultExecution timeMemory
1188224njoopA Plus B (IOI23_aplusb)C++20
10 / 100
1 ms328 KiB
#include <bits/stdc++.h> #define tii tuple<int, int, int> using namespace std; priority_queue<tii, vector<tii>, greater<tii>> pq; vector<int> ans; vector<int> smallest_sums(int N, vector<int> A, vector<int> B) { for(int i=0; i<N; i++) { pq.push({A[i]+B[i], i, i}); } while(pq.size()) { int sum = get<0>(pq.top()); int pa = get<1>(pq.top()); int pb = get<2>(pq.top()); pq.pop(); if(ans.size() >= N) continue; ans.push_back(sum); if(pb+1 < N) pq.push({A[pa]+B[pb+1], pa, pb+1}); } 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...