Submission #1247158

#TimeUsernameProblemLanguageResultExecution timeMemory
1247158susA Plus B (IOI23_aplusb)C++20
10 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; vector<int> smallest_sums(int n, vector<int> numbers1, vector<int> numbers2) { multimap<int, int> sums; for (int i = 0; i < n; i++) { sums.insert({numbers1[i] + numbers2[0], 1}); } vector<int> final_numbers(n); int next_sum; int current_index; for (int i = 0; i < n; i++) { auto first_element = *sums.begin(); final_numbers[i] = first_element.first; current_index = first_element.second; next_sum = first_element.first - numbers2[current_index - 1] + numbers2[current_index]; sums.erase(sums.begin()); if (current_index + 1 != n) { sums.insert({next_sum, current_index + 1}); } } return final_numbers; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...