Submission #202288

#	Time	Username	Problem	Language	Result	Execution time	Memory
202288		lukameladze	Just Long Neckties (JOI20_ho_t1)	C++14	9 / 100	311 ms	24700 KiB

ho_t1

# include <bits/stdc++.h>
using namespace std;
long long n,ans[200005],b[200005];
pair <long long, long long > a[20005];
multiset <long long > ms;
int main()
{
	cin>>n;
	for (int i=1; i<=n+1; i++)
	{
		cin>>a[i].first;
		a[i].second=i;
	}
	for (int i=1; i<=n; i++)
	{
		cin>>b[i];
	}
	sort(a+1,a+n+2);
	sort(b+1, b+n+1);
	for (int i=1; i<=n; i++)
	{
		ms.insert(a[i].first-b[i]);
	}
	for (int i=n+1; i>=1; i--)
	{
		ans[a[i].second]=*(--ms.end());
		if (i>1)
		{
			ms.erase(ms.find(a[i-1].first-b[i-1]));
			ms.insert(a[i].first-b[i-1]);
		}
	}
	for (int i=1; i<=n+1; i++)
	{
		cout<<ans[i]<<" ";
	}
}

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