제출 #867617

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867617		MongHwa	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	207 ms	18616 KiB

ho_t1

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

#define X first
#define Y second

int ans[200001];
int arr[200001];
multiset<int> ms;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	vector<pair<int, int>> v;
	for(int i = 0; i <= n; i++)
	{
		int x;
		cin >> x;

		v.push_back({x, i});
	}

	for(int i = 0; i < n; i++)
		cin >> arr[i];

	sort(v.begin(), v.end());
	sort(arr, arr+n);

	for(int i = 0; i < n; i++)
		ms.insert(max(0, v[i].X-arr[i]));

	ans[v[n].Y] = *ms.rbegin();
	for(int i = n-1; i >= 0; i--)
	{
		ms.erase(ms.find(max(0, v[i].X-arr[i])));
		ms.insert(max(0, v[i+1].X-arr[i]));

		ans[v[i].Y] = *ms.rbegin();
	}

	for(int i = 0; i <= n; i++)
		cout << ans[i] << ' ';
	cout << '\n';
}

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