제출 #856991

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

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
signed main()
{
    int n;cin>>n;
    pair<int,int> a[n+50];for(int i=1;i<=n+1;i++){cin>>a[i].fi;a[i].se=i;}
    int b[n+50];
    for(int i=1;i<=n;i++)cin>>b[i];
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    int res[n+50]={0},sum=0;
    for(int i=1;i<=n;i++)
	{
		sum=max(sum,max(a[i].fi-b[i],(int)0));
	}
	res[a[n+1].se]=sum;
    for(int i=n;i>=1;i--)
	{
		//sum-=max(a[i].fi-b[i],0);
		sum=max(sum,max(a[i+1].fi-b[i],(int)0));
		res[a[i].se]=sum;
	}
	for(int i=1;i<=n+1;i++) cout<<res[i]<<" ";
	cout<<endl;
    return 0;
}

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