Submission #953513

#TimeUsernameProblemLanguageResultExecution timeMemory
953513irmuunJust Long Neckties (JOI20_ho_t1)C++17
9 / 100
1055 ms11372 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n; cin>>n; ll b[n+5]; pair<ll,ll>a[n+5]; ll ans[n+5]; for(ll i=1;i<=n+1;i++){ cin>>a[i].ff; a[i].ss=i; } for(ll i=1;i<=n;i++){ cin>>b[i]; } sort(a+1,a+n+2); sort(b+1,b+n+1); ll c[n+5]; for(ll i=1;i<=n+1;i++){ ll cur=0; for(ll j=1;j<=n+1;j++){ if(j!=i){ c[++cur]=a[j].ff; } } ll res=0; for(ll j=1;j<=n;j++){ res=max(res,c[j]-b[j]); } ans[a[i].ss]=res; } for(ll i=1;i<=n+1;i++){ cout<<ans[i]<<' '; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...