#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
#define MAXN 200005
int n;
pair<int, int> a[MAXN];
int b[MAXN];
int o[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].first;
a[i].second = 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].first-b[i-1]));
}
o[a[0].second] = *prev(cur.end());
for (int i=0; i<n; i++) {
cur.erase(cur.find(max(0, a[i+1].first-b[i])));
cur.insert(max(0, a[i].first-b[i]));
o[a[i+1].second] = *prev(cur.end());
}
for (int i=0; i<n+1; i++) {
cout << o[i] << " ";
}
cout << endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
512 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
2 ms |
512 KB |
Output is correct |
| 21 |
Correct |
2 ms |
512 KB |
Output is correct |
| 22 |
Correct |
2 ms |
512 KB |
Output is correct |
| 23 |
Correct |
2 ms |
512 KB |
Output is correct |
| 24 |
Correct |
2 ms |
512 KB |
Output is correct |
| 25 |
Correct |
2 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
2 ms |
512 KB |
Output is correct |
| 28 |
Correct |
2 ms |
640 KB |
Output is correct |
| 29 |
Correct |
2 ms |
512 KB |
Output is correct |
| 30 |
Correct |
2 ms |
512 KB |
Output is correct |
| 31 |
Correct |
2 ms |
512 KB |
Output is correct |
| 32 |
Correct |
2 ms |
512 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
0 ms |
384 KB |
Output is correct |
| 8 |
Correct |
0 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
0 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
1 ms |
384 KB |
Output is correct |
| 17 |
Correct |
2 ms |
512 KB |
Output is correct |
| 18 |
Correct |
2 ms |
512 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
2 ms |
512 KB |
Output is correct |
| 21 |
Correct |
2 ms |
512 KB |
Output is correct |
| 22 |
Correct |
2 ms |
512 KB |
Output is correct |
| 23 |
Correct |
2 ms |
512 KB |
Output is correct |
| 24 |
Correct |
2 ms |
512 KB |
Output is correct |
| 25 |
Correct |
2 ms |
512 KB |
Output is correct |
| 26 |
Correct |
2 ms |
512 KB |
Output is correct |
| 27 |
Correct |
2 ms |
512 KB |
Output is correct |
| 28 |
Correct |
2 ms |
640 KB |
Output is correct |
| 29 |
Correct |
2 ms |
512 KB |
Output is correct |
| 30 |
Correct |
2 ms |
512 KB |
Output is correct |
| 31 |
Correct |
2 ms |
512 KB |
Output is correct |
| 32 |
Correct |
2 ms |
512 KB |
Output is correct |
| 33 |
Correct |
253 ms |
17528 KB |
Output is correct |
| 34 |
Correct |
244 ms |
18168 KB |
Output is correct |
| 35 |
Correct |
244 ms |
17656 KB |
Output is correct |
| 36 |
Correct |
249 ms |
18140 KB |
Output is correct |
| 37 |
Correct |
257 ms |
18808 KB |
Output is correct |
| 38 |
Correct |
250 ms |
18488 KB |
Output is correct |
| 39 |
Correct |
363 ms |
17528 KB |
Output is correct |
| 40 |
Correct |
355 ms |
17528 KB |
Output is correct |
| 41 |
Correct |
369 ms |
17528 KB |
Output is correct |
| 42 |
Correct |
372 ms |
17656 KB |
Output is correct |
| 43 |
Correct |
381 ms |
17400 KB |
Output is correct |
| 44 |
Correct |
197 ms |
16888 KB |
Output is correct |
| 45 |
Correct |
198 ms |
17020 KB |
Output is correct |
| 46 |
Correct |
197 ms |
16888 KB |
Output is correct |
| 47 |
Correct |
204 ms |
17400 KB |
Output is correct |
| 48 |
Correct |
204 ms |
17272 KB |
Output is correct |
| 49 |
Correct |
338 ms |
18040 KB |
Output is correct |
| 50 |
Correct |
336 ms |
17912 KB |
Output is correct |
| 51 |
Correct |
353 ms |
17912 KB |
Output is correct |
| 52 |
Correct |
356 ms |
17912 KB |
Output is correct |
| 53 |
Correct |
340 ms |
17912 KB |
Output is correct |
