Submission #1259479

#TimeUsernameProblemLanguageResultExecution timeMemory
1259479trantrungkeinJust Long Neckties (JOI20_ho_t1)C++20
9 / 100
1095 ms3700 KiB
#include<bits/stdc++.h>
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
using namespace std;
const int N = 1e6;
int n,b[N],a[N];
int main()
{
    cin >> n;
    For(i,1,n+1) cin >> a[i];
    For(i,1,n) cin >> b[i];
    sort(b+1,b+n+1);
    For(k,1,n+1)
    {
        vector<int> v;
        for(int i = 1; i <= n+1; i++) if(i != k) v.push_back(a[i]);
        sort(v.begin(),v.end());
        int ans = 0;
        for(int i = 0; i < n; i++)
            ans = max(ans,v[i] - b[i+1]);
        cout << ans <<'\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...