#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<int> b, ans;
vector<pair<int, int>> a;
int main() {
cin >> n;
a.resize(n + 1), b.resize(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i].first;
a[i].second = i;
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
ans.resize(n + 1);
int oddity = 0;
for (int i = 0; i < n; i++) {
oddity = max(oddity, max(a[i].first - b[i], 0));
}
ans[a[n].second] = oddity;
for (int i = n; i >= 1; i--) {
oddity = max(oddity, max(a[i].first - b[i - 1], 0));
ans[a[i - 1].second] = oddity;
}
for (int i = 0; i < n + 1; i++) {
cout << ans[i] << ' ';
}
cout << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
2 ms |
340 KB |
Output is correct |
| 18 |
Correct |
2 ms |
212 KB |
Output is correct |
| 19 |
Correct |
2 ms |
340 KB |
Output is correct |
| 20 |
Correct |
2 ms |
212 KB |
Output is correct |
| 21 |
Correct |
2 ms |
212 KB |
Output is correct |
| 22 |
Correct |
2 ms |
212 KB |
Output is correct |
| 23 |
Correct |
2 ms |
212 KB |
Output is correct |
| 24 |
Correct |
2 ms |
212 KB |
Output is correct |
| 25 |
Correct |
3 ms |
212 KB |
Output is correct |
| 26 |
Correct |
2 ms |
212 KB |
Output is correct |
| 27 |
Correct |
2 ms |
340 KB |
Output is correct |
| 28 |
Correct |
2 ms |
212 KB |
Output is correct |
| 29 |
Correct |
2 ms |
212 KB |
Output is correct |
| 30 |
Correct |
2 ms |
212 KB |
Output is correct |
| 31 |
Correct |
2 ms |
212 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 |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
2 ms |
340 KB |
Output is correct |
| 18 |
Correct |
2 ms |
212 KB |
Output is correct |
| 19 |
Correct |
2 ms |
340 KB |
Output is correct |
| 20 |
Correct |
2 ms |
212 KB |
Output is correct |
| 21 |
Correct |
2 ms |
212 KB |
Output is correct |
| 22 |
Correct |
2 ms |
212 KB |
Output is correct |
| 23 |
Correct |
2 ms |
212 KB |
Output is correct |
| 24 |
Correct |
2 ms |
212 KB |
Output is correct |
| 25 |
Correct |
3 ms |
212 KB |
Output is correct |
| 26 |
Correct |
2 ms |
212 KB |
Output is correct |
| 27 |
Correct |
2 ms |
340 KB |
Output is correct |
| 28 |
Correct |
2 ms |
212 KB |
Output is correct |
| 29 |
Correct |
2 ms |
212 KB |
Output is correct |
| 30 |
Correct |
2 ms |
212 KB |
Output is correct |
| 31 |
Correct |
2 ms |
212 KB |
Output is correct |
| 32 |
Correct |
2 ms |
340 KB |
Output is correct |
| 33 |
Correct |
184 ms |
4704 KB |
Output is correct |
| 34 |
Correct |
193 ms |
8744 KB |
Output is correct |
| 35 |
Correct |
190 ms |
8416 KB |
Output is correct |
| 36 |
Correct |
213 ms |
8948 KB |
Output is correct |
| 37 |
Correct |
197 ms |
9272 KB |
Output is correct |
| 38 |
Correct |
198 ms |
9124 KB |
Output is correct |
| 39 |
Correct |
187 ms |
8188 KB |
Output is correct |
| 40 |
Correct |
185 ms |
8100 KB |
Output is correct |
| 41 |
Correct |
187 ms |
8300 KB |
Output is correct |
| 42 |
Correct |
219 ms |
8212 KB |
Output is correct |
| 43 |
Correct |
184 ms |
8128 KB |
Output is correct |
| 44 |
Correct |
181 ms |
7768 KB |
Output is correct |
| 45 |
Correct |
193 ms |
7912 KB |
Output is correct |
| 46 |
Correct |
194 ms |
7764 KB |
Output is correct |
| 47 |
Correct |
185 ms |
7776 KB |
Output is correct |
| 48 |
Correct |
186 ms |
7876 KB |
Output is correct |
| 49 |
Correct |
193 ms |
8392 KB |
Output is correct |
| 50 |
Correct |
217 ms |
8396 KB |
Output is correct |
| 51 |
Correct |
190 ms |
8396 KB |
Output is correct |
| 52 |
Correct |
195 ms |
8408 KB |
Output is correct |
| 53 |
Correct |
199 ms |
8396 KB |
Output is correct |
