# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066892 | MunkhErdene | 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
using namespace std;
#define no cout<<"NO"<<endl
#define yes cout<<"YES"<<endl
const ll mod=998244353;
int *solve(int n, int arr1[100'000], int arr2[100'000]){
sort(arr1, arr1+n);
sort(arr2, arr2+n);
int g=0;
int h=0;
int* result = new int[100'000];
for(int i=0 ; i<n ; i++){
result[i]=arr1[g]+arr2[h];
if(arr1[g+1]+arr2[h]>arr1[g]+arr2[h+1]){
h++;
}
else{
g++;
}
}
return result;
}