Submission #1341827

#TimeUsernameProblemLanguageResultExecution timeMemory
1341827iq500Just Long Neckties (JOI20_ho_t1)C++20
9 / 100
1095 ms6152 KiB
#include <bits/stdc++.h>
#define pb push_back
#define fir first
#define sec second
#define int long long
using namespace std;

signed main(){
    int n; cin>>n;
    int b[n+1];
    pair<int, int> a[n+2];
    for(int i=1; i<=n+1; i++){
        cin>>a[i].fir;
        a[i].sec=i;
    }
    for(int i=1; i<=n; i++) cin>>b[i];
    sort(a+1, a+n+2);
    sort(b+1, b+n+1);
    int cev[n+2]={0};
    for(int i=1; i<=n+1; i++){
        int ind=1;
        int ans=0;
        for(int j=1; j<=n; j++){
            if(ind==i) ind++;
            ans=max(ans, max(a[ind].fir-b[j], 0LL));
            ind++;
        }
        cev[a[i].sec]=ans;
    }
    for(int i=1; i<=n+1; i++) cout<<cev[i]<<" ";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...