| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 961096 | The_Cryptic_TG | 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>
#define ll long long
vector<ll> smallest_sums(ll n, vector<ll> a, vector<ll> b)
    {
        multiset<ll> s;
        loop1(i, n)
        {
            loop(j, n / i)
            {
                s.insert(a[i - 1] + b[j]);
            }
        }
        auto it = s.begin();
        ll k = n;
        vector <ll> ans;
        while (k--)
        {
            ans.push_back(*it);
            it++;
        }
        return ans;
    }
