제출 #568096

#제출 시각아이디문제언어결과실행 시간메모리
568096luka1234Just Long Neckties (JOI20_ho_t1)C++14
0 / 100
0 ms212 KiB
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define db double
using namespace std;
int n;
int a[200002];
int b[200002];
int mxpref[200002],mxsuf[200002];
int main(){
	cin>>n;
	for(int k=1;k<=n+1;k++){
		cin>>a[k];
	}
	for(int k=1;k<=n;k++){
		cin>>b[k];
	}
	sort(a+1,a+n+2);
	sort(b+1,b+n+1);
	int mx=0,cur;
	for(int k=1;k<=n;k++){
		cur=max(0,a[k]-b[k]);
		mx=max(mx,cur);
		mxpref[k]=mx;
	}
	mx=0;
	for(int k=n;k>=1;k--){
		cur=max(0,a[k+1]-b[k]);
		mx=max(mx,cur);
		mxsuf[k]=mx;
	}
	int mx1=0,mx2=0;
	for(int k=1;k<=n+1;k++){
		mx1=mxpref[k-1];
		mx2=mxsuf[k];
		cout<<max(mx1,mx2)<<" ";
	}
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...