Submission #1144904

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144904		ezzzay	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	0 ms	320 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=2e5+5;
signed main(){
	int n;
	cin>>n;
	vector<int>b(n+5);
	vector<int>ans(n+5);
	vector<pair<int,int>> a(n+5);
	for(int i=1;i<=n+1;i++){
		cin>>a[i].ff;
		a[i].ss=i;
	}
	multiset<int>st;
	for(int i=1;i<=n;i++)cin>>b[i];
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	for(int i=1;i<=n;i++){
		st.insert(-max(0, a[i+1].ff - b[i]));
	}
	ans[a[1].ss]-= *(st.begin());
	for(int i=2;i<=n+1;i++){
		st.erase(st.find(-max(0,a[i].ff-b[i-1])));
		st.insert(-max(0, a[i-1].ff - b[i-1]));
		ans[a[i].ss]-= *(st.begin());
	}
	for(int i=1;i<=n+1;i++)cout<<ans[i]<<" ";
	
}

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