# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1028350 | sqrteipi | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 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;
#define pii pair<int, int>
int[] smallest_sums(int n, int[] a, int[] b) {
sort(b, b+n);
int ans[n], ptr[n], p=0;
priority_queue<pii, vector<pii>, greater<pii>> pq;
for (int i=0; i<n; i++) pq.push({a[i] + b[0], i});
for (int i=0; i<n; i++) ptr[i] = 1;
while (!pq.empty()) {
if (p == n) break;
ans[p++] = pq.top().first;
int ind = pq.top().second;
pq.pop();
if (ptr[ind] == n) continue;
pq.push({a[ind] + b[ptr[ind]], ind});
ptr[ind]++;
}
return ans;
}