# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1247120 | sus | A Plus B (IOI23_aplusb) | C++20 | 0 ms | 0 KiB |
int *smallest_sums(int n, int numbers1[], int numbers2[])
{
ios::sync_with_stdio(0);
// cin.tie(0);
// int n;
// cin >> n;
// vector<int> numbers1(n);
// vector<int> numbers2(n);
// for (int i = 0; i < n; i++)
// {
// cin >> numbers1[i];
// }
// for (int i = 0; i < n; i++)
// {
// cin >> numbers2[i];
// }
multimap<int, int> sums;
for (int i = 0; i < n; i++)
{
sums.insert({numbers1[i] + numbers2[0], 1});
}
// vector<int> final_numbers;
int final_numbers[n];
int next_sum;
int current_index;
for (int i = 0; i < n; i++)
{
auto first_element = *sums.begin();
// final_numbers.push_back(first_element.first);
final_numbers[i] = first_element.first;
current_index = first_element.second;
next_sum = first_element.first + numbers2[first_element.second];
sums.erase(sums.begin());
if (current_index + 1 != n)
{
sums.insert({next_sum, current_index + 1});
}
}
// for (int num : final_numbers)
//{
// cout << num << " ";
// }
return final_numbers;
}