#include <bits/stdc++.h>
using namespace std;
#define ll long long
struct gay
{
ll value, index;
};
bool cmp(const gay &a, const gay &b)
{
return a.value < b.value;
}
int main()
{
ll n;
cin >> n;
gay a[n + 2];
ll b[n + 1];
ll maxt = -1;
for (ll i = 1; i <= n + 1; ++i)
{
cin >> a[i].value;
a[i].index = i;
}
for (ll i = 1; i <= n; ++i) cin >> b[i];
sort(a + 1, a + n + 2, cmp);
sort(b + 1, b + n + 1);
for (ll i = 1; i <= n; ++i)
{
ll tmp = a[i].value - b[i];
maxt = max(maxt, max(tmp, 0LL));
}
//cout << maxt << endl;
ll ans[n + 2];
ans[a[n + 1].index] = maxt;
for (ll i = n; i >= 1; --i)
{
maxt = max(maxt, max(a[i + 1].value - b[i], 0LL));
ans[a[i].index] = maxt;
//cout << a[n + 1].value << " " << b[i] << " " << maxt << ' ';
}
for (ll i = 1; i <= n + 1; ++i) cout << ans[i] << ' ';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
2 ms |
340 KB |
Output is correct |
18 |
Correct |
2 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
328 KB |
Output is correct |
25 |
Correct |
2 ms |
340 KB |
Output is correct |
26 |
Correct |
2 ms |
340 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
340 KB |
Output is correct |
29 |
Correct |
2 ms |
432 KB |
Output is correct |
30 |
Correct |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
2 ms |
340 KB |
Output is correct |
32 |
Correct |
2 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
2 ms |
340 KB |
Output is correct |
18 |
Correct |
2 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
2 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
2 ms |
328 KB |
Output is correct |
25 |
Correct |
2 ms |
340 KB |
Output is correct |
26 |
Correct |
2 ms |
340 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
340 KB |
Output is correct |
29 |
Correct |
2 ms |
432 KB |
Output is correct |
30 |
Correct |
2 ms |
340 KB |
Output is correct |
31 |
Correct |
2 ms |
340 KB |
Output is correct |
32 |
Correct |
2 ms |
340 KB |
Output is correct |
33 |
Correct |
166 ms |
7684 KB |
Output is correct |
34 |
Correct |
152 ms |
8004 KB |
Output is correct |
35 |
Correct |
153 ms |
7716 KB |
Output is correct |
36 |
Correct |
153 ms |
8264 KB |
Output is correct |
37 |
Correct |
156 ms |
8400 KB |
Output is correct |
38 |
Correct |
162 ms |
8396 KB |
Output is correct |
39 |
Correct |
148 ms |
7400 KB |
Output is correct |
40 |
Correct |
148 ms |
7372 KB |
Output is correct |
41 |
Correct |
145 ms |
7448 KB |
Output is correct |
42 |
Correct |
151 ms |
7504 KB |
Output is correct |
43 |
Correct |
144 ms |
7384 KB |
Output is correct |
44 |
Correct |
156 ms |
7056 KB |
Output is correct |
45 |
Correct |
152 ms |
7084 KB |
Output is correct |
46 |
Correct |
146 ms |
7048 KB |
Output is correct |
47 |
Correct |
136 ms |
7016 KB |
Output is correct |
48 |
Correct |
139 ms |
7016 KB |
Output is correct |
49 |
Correct |
153 ms |
7656 KB |
Output is correct |
50 |
Correct |
150 ms |
7656 KB |
Output is correct |
51 |
Correct |
173 ms |
7652 KB |
Output is correct |
52 |
Correct |
168 ms |
7668 KB |
Output is correct |
53 |
Correct |
151 ms |
7656 KB |
Output is correct |