| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 954022 | ALTAKEXE | A Plus B (IOI23_aplusb) | C++17 | 43 ms | 6924 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<int> smallest_sums(int N, vector<int> A, vector<int> B)
{
int n = N;
auto a = A, b = B;
priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<>> pq;
for (int i = 0; i < n; i++)
pq.push({a[i] + b[0], i, 0});
vector<int> ans;
while (ans.size() < n)
{
int val, x, y;
tie(val, x, y) = pq.top();
pq.pop();
ans.push_back(val);
if (y + 1 < n)
pq.push({a[x] + b[y + 1], x, y + 1});
}
return ans;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
