#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define oo 10000000000000001
int n,b[200005],c[200005],tmp,d0[200005],d1[200005];
pair<int,int> a[200005]; //value,key
multiset<int> s;
signed main(){
ios::sync_with_stdio(0),cin.tie(0);
cin>>n;
for(int i=1;i<=n+1;i++){
cin>>tmp;
a[i]={tmp,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++){
d0[i]=max(0,a[i].first-b[i]);
s.insert(d0[i]);
d1[i+1]=max(0,a[i+1].first-b[i]);
}
for(int i=n+1;i>=2;i--){
c[a[i].second]=*s.rbegin();
s.insert(d1[i]);
s.erase(s.find(d0[i-1]));
}
c[a[1].second]=*s.rbegin();
for(int i=1;i<=n+1;i++) cout<<c[i]<<(i==n+1?'\n':' ');
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |