| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1075590 | quangminh412 | Just Long Neckties (JOI20_ho_t1) | C++14 | 1 ms | 344 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
/*
  John Watson
  https://codeforces.com/profile/quangminh98
  Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const int maxn = 2e5 + 9;
int n;
int b[maxn], ans[maxn];
pair<int, int> a[maxn];
signed main()
{
	if (fopen("test.inp", "r"))
	{
		freopen("test.inp", "r", stdin);
		freopen("test.out", "w", stdout);
	}
	faster();
	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);
	
	multiset<int> se;
	for (int i = 2; i <= n + 1; i++)
		se.insert(max(0, a[i].first - b[i - 1]));
	ans[a[1].second] = *se.rbegin();
	for (int i = 2; i <= n + 1; i++)
	{
		se.insert(max(0, a[i - 1].first - b[i - 1]));
		se.erase(se.find(max(0, a[i].first - b[i - 1])));
		ans[i] = *se.rbegin();
	}
	
	for (int i = 1; i <= n + 1; i++)
		cout << ans[i] << ' ';
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
