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;
typedef pair <int, int> pii;
const int maxn = 2e5 + 2;
int ans[maxn], b[maxn];
pii a[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
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> S;
for (int i = 1; i <= n; i++) {
S.insert(a[i].first - b[i - 1]);
// cout << a[i].first << ' ' << b[i - 1] << endl;
}
ans[a[0].second] = *S.rbegin();
for (int i = 1; i <= n; i++) {
S.erase(S.find(a[i].first - b[i - 1]));
S.insert(a[i - 1].first - b[i - 1]);
ans[a[i].second] = *S.rbegin();
}
for (int i = 0; i <= n; i++)
cout << ans[i] << ' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |