Submission #260360

#	Time	Username	Problem	Language	Result	Execution time	Memory
260360		sahil_k	Just Long Neckties (JOI20_ho_t1)	C++14	0 / 100	0 ms	384 KiB

ho_t1

#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define MAXN 200005
int n;
int a[MAXN], b[MAXN];
int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i=0; i<=n; i++) {
		cin >> a[i];
	}
	sort(a, a+n+1);
	for (int i=0; i<n; i++) {
		cin >> b[i];
	}
	sort(b, b+n);
	multiset<int> cur;
	for (int i=1; i<=n; i++) {
		cur.insert(max(0, a[i]-b[i-1]));
	}
	cout << *prev(cur.end()) << " ";
	for (int i=0; i<n; i++) {
		cur.erase(cur.find(max(0, a[i+1]-b[i])));
		cur.insert(max(0, a[i]-b[i]));
		cout << *prev(cur.end()) << " ";
	}
	cout << endl;
}

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