# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763005 | vjudge1 | Just Long Neckties (JOI20_ho_t1) | C++17 | 162 ms | 8908 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;
#define ll long long
int main(){
int n,a; cin>>n;
pair<int,int> c[n+2]; int arr[n+1],pos[n+1];
vector<int> ans(n+2,0);
for(int i=1;i<=n+1;++i){
cin>>c[i].first; c[i].second = i;
}
for(int i=1;i<=n;++i){
cin>>arr[i];
}
sort(c+1,c+n+2);
sort(arr+1,arr+n+1);
for(int i=1;i<=n;++i){
ans[c[n+1].second]=max(ans[c[n+1].second],max(c[i].first-arr[i],0));
}
for(int i=n;i>=1;--i){
ans[c[i].second] = max(ans[c[i+1].second],c[i+1].first-arr[i]);
}
for(int i=1;i<=n+1;++i){
cout<<ans[i]<<' ';
}
}
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... |