Submission #839533

#TimeUsernameProblemLanguageResultExecution timeMemory
839533model_codeA Plus B (IOI23_aplusb)C++17
100 / 100
54 ms3528 KiB
// correct/sol-birka0-full.cpp #include "aplusb.h" #include <queue> using namespace std; using pii = pair<int,int>; vector<int> smallest_sums(int N, vector<int> A, vector<int> B) { auto cmp = [&](const pii& p1, const pii& p2) { return A[p1.first] + B[p1.second] > A[p2.first] + B[p2.second]; }; priority_queue<pii, vector<pii>, decltype(cmp)> q(cmp); for (int i = 0; i < N; ++i) q.push({i, 0}); vector<int> res; while (res.size() < N) { auto [i, j] = q.top(); q.pop(); res.push_back(A[i] + B[j]); q.push({i, j+1}); } return res; }

Compilation message (stderr)

aplusb.cpp: In function 'std::vector<int> smallest_sums(int, std::vector<int>, std::vector<int>)':
aplusb.cpp:19:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |     while (res.size() < N) {
      |            ~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...