| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 959291 | vjudge1 | 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>
using namespace std;
int* smallest_sums(int N, int* A, int* B) {
multiset<int> res;
for(int i=0 ;i<N ;i++) {
for(int j=0 ;j<N ;j++) {
res.insert(A[i]+B[j]);
}
}
int x[N] ;
multiset<int>::iterator itr= res.begin();
int i =0;
while (N--) {
x[i] = *itr;
i++ ;
++itr;
}
return x;
}
