# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566918 | almothana05 | Just Long Neckties (JOI20_ho_t1) | C++14 | 0 ms | 212 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 mod 1000000007
#define inf 100000000000000000
using namespace std;
vector<int>num , cmp;
int suf[200001];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int menge, numm , nummer;
cin >> menge;
for(int i = 0 ; i < menge + 1; i++){
cin >> numm;
cmp.push_back(numm);
}
for(int i = 0 ; i < menge ; i++){
cin >> numm;
num.push_back(numm);
}
sort(num.begin() , num.end());
sort(cmp.begin() , cmp.end());
for(int i = menge - 1 ; i >= 0 ; i--){
suf[i] = max(suf[i + 1] , max(0 , cmp[i + 1] - num[i]));
}
int pref = 0;
for(int i = 0 ; i < menge + 1; i++){
if(i == 0){
cout << suf[i] << " ";
continue;
}
pref = max(pref , max(0 , cmp[i - 1] - num[i - 1]));
cout << max(suf[i] , pref) << " ";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |