제출 #392644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
392644		wind_reaper	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	1 ms	204 KiB

ho_t1

#include <bits/stdc++.h>

using namespace std;

int32_t main(){
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL); 
	
	int n; 
	cin >> n;

	vector<int> A(n+1), B(n);
	for(int i = 0; i <= n; i++)
		cin >> A[i];
	for(int i = 0; i < n; i++)
		cin >> B[i];

	sort(B.begin(), B.end());

	vector<pair<int, int>> C(n+1);
	for(int i = 0; i <= n; i++)
		C[i] = {A[i], i};

	sort(C.begin(), C.end());

	multiset<pair<int, int>> maxdiff;
	vector<int> ans(n+1);

	for(int i = 0; i < n; i++){
		maxdiff.insert({-abs(B[i]-C[i].first), B[i]});
	}

	ans[C[n].second] = maxdiff.begin()->first;

	for(int j = n-1; j >= 0; --j){
		int original = -abs(B[j]-C[j].first);
		maxdiff.erase(maxdiff.find({original, B[j]}));
		maxdiff.insert({-abs(B[j]-C[j+1].first), B[j]});
		ans[C[j].second] = maxdiff.begin()->first;
	}

	for(int i : ans)
		cout << -i << ' ';
	return 0; 
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 8
• Subtask 3: 0 / 91