# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
973064 | marinaluca | 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>
#pragma GCC opitmize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
using namespace std;
#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin (x), end(x)
vector <int> smallest_sums (int N, vector <int> a, vector <int> b){
sort (a.begin(), a.end());
sort (b.begin(), b.end())
set <pair<int, pair<int, int>>> s;
vector <int> rez;
for (int i = 0; i < n; ++ i){
s.insert ({a[i] + b[i], {i, 0}});
}
for (int i = 0; i < n; ++ i){
auto val = *s.begin();
rez.push_back(val.xx);
s.insert ({a[s.yy.xx] + b[s.yy.yy + 1], {val.yy.xx, val.yy.yy + 1}});
s.erase(val);
}
return rez;
}