#include <bits/stdc++.h>
using namespace std;
vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
set<tuple<int, int, int>> s;
vector<int> c;
s.emplace(a[0] + b[0], 0, 0);
set<pair<int, int>> k;
while (c.size() < n) {
auto [x, y, z] = *s.begin();
s.erase(s.begin());
if (k.count({y, z})) continue;
k.emplace(y, z);
c.emplace_back(x);
s.emplace(a[y + 1] + a[z], y + 1, z);
s.emplace(a[z + 1] + a[y], y, z + 1);
}
return c;
}
# | 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... |