Submission #1164208

#TimeUsernameProblemLanguageResultExecution timeMemory
1164208KhoaDuyGrowing Vegetables is Fun 5 (JOI24_vegetables5)C++17
30 / 100
5089 ms13072 KiB
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int calc(vector<int> a,vector<int> b){
    int curr=0;
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    for(int i=0;i<a.size();i++){
        curr=max(curr,abs(a[i]-b[i]));
    }
    return curr;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int> a(2*n),b(n),c(n);
    for(int i=0;i<2*n;i++){
        cin >> a[i];
    }
    for(int i=0;i<n;i++){
        cin >> b[i];
    }
    for(int i=0;i<n;i++){
        cin >> c[i];
    }
    int ans=1e9;
    for(int l=0;l<=n;l++){
        vector<int> le,ri;
        for(int i=0;i<2*n;i++){
            if(i-l>=0&&i-l<n){
                le.push_back(a[i]);
            }
            else{
                ri.push_back(a[i]);
            }
        }
        ans=min(ans,max(calc(le,b),calc(ri,c)));
        ans=min(ans,max(calc(le,c),calc(ri,b)));
    }
    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...