| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1153973 | JahonaliX | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 328 KiB |
#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);
while (c.size() < n) {
auto [x, y, z] = *s.begin();
s.erase(s.begin());
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... | ||||
