# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389041 | keta_tsimakuridze | Just Long Neckties (JOI20_ho_t1) | C++14 | 1 ms | 204 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 f first
#define int long long
#define s second
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,a[N],b[N],n;
multiset<int>s;
main(){
// t=1;
cin>>n;
for(int i=1;i<=n+1;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
cin>>b[i];
}
sort(a+1,a+n+2);
sort(b+1,b+n+1);
for(int i=1;i<=n;i++){
s.insert(-b[i]+a[i+1]);
}
cout<<*--s.end()<<" ";
for(int i=2;i<=n+1;i++){
s.erase(s.find(-b[i-1]+a[i]));
s.insert(-b[i-1]+a[i-1]);
cout<<*--s.end()<<" ";
}
}
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... |