Submission #1165507

#TimeUsernameProblemLanguageResultExecution timeMemory
1165507irmuunGrowing Vegetables is Fun 5 (JOI24_vegetables5)C++20
30 / 100
5088 ms18648 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 a[2*n+5],b[n+5],c[n+5];
    for(ll i=1;i<=2*n;i++) cin>>a[i];
    for(ll i=1;i<=n;i++) cin>>b[i];
    for(ll i=1;i<=n;i++) cin>>c[i];
    sort(b+1,b+n+1);
    sort(c+1,c+n+1);
    ll ans=(ll)1e18;
    for(ll l=1;l<=n+1;l++){
        vector<ll>L,R;
        for(ll i=l;i<l+n;i++){
            L.pb(a[i]);
        }
        for(ll i=1;i<=2*n;i++){
            if(i<l||i>=l+n) R.pb(a[i]);
        }
        sort(all(L));
        sort(all(R));
        ll res=0;
        for(ll i=0;i<n;i++){
            res=max({res,abs(L[i]-b[i+1]),abs(R[i]-c[i+1])});
        }
        ans=min(ans,res);
        res=0;
        for(ll i=0;i<n;i++){
            res=max({res,abs(L[i]-c[i+1]),abs(R[i]-b[i+1])});
        }
        ans=min(ans,res);
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...