Submission #503537

#TimeUsernameProblemLanguageResultExecution timeMemory
503537maco1503Just Long Neckties (JOI20_ho_t1)C++14
100 / 100
108 ms6116 KiB
#include <bits/stdc++.h>
#define rpd ios_base :: sync_with_stdio(0); cin.tie(0);
#define ll long long
#define fs first
#define sc second
#define pb push_back
#define mod 666013
#define NMAX 200000 + 100
using namespace std;

int a[NMAX], b[NMAX], c[NMAX], n;
pair<int, int> cr[NMAX];


int main()
{

    rpd;
    cin>>n;
    for(int i=1;i<=n+1;i++){
        cin>>a[i];
        cr[i]={a[i],i};
    }
    for(int i=1;i<=n;i++)cin>>b[i];
    sort(cr+1,cr+n+2);
    sort(b+1,b+n+1);
    int maxi=0;
    for(int i=1;i<=n;i++)maxi=max(maxi,cr[i].first-b[i]);
    for(int i=n+1;i>=1;i--)
    {
        if(i==n+1)c[cr[i].second]=maxi;
        else {
            maxi=max(maxi,cr[i+1].first-b[i]);
            c[cr[i].second]=maxi;
        }

    }
    for(int i=1;i<=n+1;i++)cout<<c[i]<<' ';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...