Submission #1221011

#	Time	Username	Problem	Language	Result	Execution time	Memory
1221011		checker1234	Just Long Neckties (JOI20_ho_t1)	C++20	0 / 100	1 ms	320 KiB

ho_t1

#include<bits/stdc++.h>
using namespace std;
const int N=1e8;
int n;
int a[N+1],b[N];
int pre[N+1],suf[N];
int main()
{
	cin>>n;
	
	for(int i=0;i<=n;i++)cin>>a[i];
	for(int i=0;i<n;i++)cin>>b[i];
    
    sort(a,a+n+1);
    sort(b,b+n);
	
	for(int i=0;i<n;i++)
	{
		pre[i]=max(0,a[i]-b[i]);
		if(i>0)pre[i]=max(pre[i],pre[i-1]);
	}
	for(int i=n-1;i>=0;i--)
	{
		suf[i]=max(0,a[i+1]-b[i]);
		if(i<n)suf[i]=max(suf[i],suf[i+1]);
	}
    for(int i=0;i<=n;i++)
	{
		int ans=0;
		if(i>0)ans=max(ans,pre[i-1]);
		if(i<n)ans=max(ans,suf[i]);
		cout<<ans<<" ";
	}
	cout<<endl;
}

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