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;
vector<int> smallest_sums(int n, vector<int> a, vector<int> b)
{
	multiset<int> s;
        for (int i =1 ; i<=n ; i++)
        {
            for (int j = 0 ; j <= n/i ; j++)
            {   if (j>=n)continue;
                s.insert(a[i - 1] + b[j]);
            }
        }
        auto it = s.begin();
        int k = n;
        vector <int> ans;
        while (k--)
        {
            ans.push_back(*it);
            it++;
        }
        return ans;
}
| # | 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... |