#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<pair<int, int>> a(n+1);
vector<int> b(n);
for (int i = 0; i <= n; 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());
vector<int> c(n+1);
multiset<int> diff;
for (int i = 0; i < n; i++) diff.insert(abs(a[i+1].first-b[i]));
c[a[0].second] = *diff.rbegin();
for (int i = 0; i < n; i++) {
diff.erase(diff.find({a[i+1].first-b[i]}));
diff.insert(abs(a[i].first-b[i]));
c[a[i+1].second] = *diff.rbegin();
}
for (int i = 0; i <= n; i++) cout << c[i] << ' ';
cout << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Runtime error |
1 ms |
592 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |