제출 #1273162

#제출 시각아이디문제언어결과실행 시간메모리
1273162jose_ernestoJust Long Neckties (JOI20_ho_t1)C++20
9 / 100
1096 ms6204 KiB
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define pii pair<int, int>
#define sd second
#define fs first
#define vi vector<int>
#define vii vi<vi>
#define vpii vector<pii>
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

using namespace std;

const int oo=1e18,MAX=2e5+5;

int32_t main(){
    fast
    int a,n;
    cin>>n;
    vpii c(n+1);
    vi e(n),ans(n+1);
    for(int i=0;i<=n;i++){
        cin>>c[i].fs;
        c[i].sd=i;
    }
    for(int i=0;i<n;i++){
        cin>>e[i];
    }
    sort(c.begin(),c.end());
    sort(e.begin(),e.end());
    for(int i=0;i<=n;i++){
        int x=0,y=0,aux=0;
        while(y<n){
            if(x==i){x++;continue;}
            aux=max(aux,c[x].fs-e[y]);
            x++;y++;
        }
        ans[c[i].sd]=aux;
    }
    for(int i=0;i<=n;i++){
        cout<<ans[i]<<" ";
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...