제출 #954829

#제출 시각아이디문제언어결과실행 시간메모리
9548294QT0RJust Long Neckties (JOI20_ho_t1)C++17
100 / 100
70 ms9300 KiB
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>

pii kra[200003]; 
int pep[200003];
int ans[200003];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	for (int i = 0; i<=n; i++){
		cin >> kra[i].first;
		kra[i].second=i;
	}
	for (int i = 1; i<=n; i++){
		cin >> pep[i];
	}
	sort(kra,kra+n+1);
	sort(pep+1,pep+n+1);
	int mx=0;
	for (int i = 1; i<=n; i++){
		mx=max(mx,kra[i-1].first-pep[i]);
	}
	ans[kra[n].second]=mx;
	for (int i = n; i; i--){
		ans[kra[i-1].second]=max(ans[kra[i].second],kra[i].first-pep[i]);
	}
	for (int i = 0; i<=n; i++){
		cout << ans[i] << ' ';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...