# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393591 | 79brue | Just Long Neckties (JOI20_ho_t1) | C++14 | 316 ms | 18672 KiB |
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 long long ll;
int n;
pair<int, int> a[200002];
int b[200002];
multiset<int> mst;
int ans[200002];
int main(){
scanf("%d", &n);
for(int i=1; i<=n+1; i++){
scanf("%d", &a[i].first);
a[i].second = i;
}
for(int i=1; i<=n; i++) scanf("%d", &b[i]);
sort(a+1, a+n+2);
sort(b+1, b+n+1);
for(int i=1; i<=n; i++){
mst.insert(a[i].first - b[i]);
}
ans[a[n+1].second] = *mst.rbegin();
for(int i=n; i>=1; i--){
mst.erase(mst.find(a[i].first - b[i]));
mst.insert(a[i+1].first - b[i]);
ans[a[i].second] = *mst.rbegin();
}
for(int i=1; i<=n+1; i++) printf("%d ", max(ans[i], 0));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |