제출 #534391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534391		alvingogo	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	295 ms	21700 KiB

ho_t1

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;

signed main(){
	AquA;
	int n;
	cin >> n;
	vector<pair<int,int> > v(n+1);
	vector<int> b(n);
	for(int i=0;i<=n;i++){
		cin >> v[i].fs;
		v[i].sc=i;
	}
	for(int i=0;i<n;i++){
		cin >> b[i];
	}
	sort(b.begin(),b.end());
	sort(v.begin(),v.end());
	vector<int> ans(n+1);
	multiset<int,greater<int> > m;
	for(int i=0;i<n;i++){
		m.insert(max(v[i+1].fs-b[i],0ll));
	}
	for(int i=0;i<=n;i++){
		ans[v[i].sc]=*m.begin();
		if(i!=n){
			m.erase(m.find(max(v[i+1].fs-b[i],0ll)));
			m.insert(max(v[i].fs-b[i],0ll));
		}
	}
	for(int i=0;i<=n;i++){
		cout << ans[i] << " ";
	}
	cout << "\n";
	return 0;
}

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