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 "aplusb.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define no cout<<"NO"<<endl
#define yes cout<<"YES"<<endl
const ll mod=998244353;
vector<int> smallest_sums(int n, vector<int>arr1, vector<int>arr2){
vector<int> sum;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n/(i+1); j++) {
sum.push_back(arr1[i]+arr2[j]);
}
}
sort(sum.begin(), sum.end());
vector<int> result(n);
for (int i = 0; i < n; i++) {
result[i] = sum[i];
}
return result;
}
# | 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... |