Submission #532098

#	Time	Username	Problem	Language	Result	Execution time	Memory
532098		scottchou	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	168 ms	468 KiB

ho_t1

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int const N = 2005;
int a[N], b[N];
int main(){
    int n;
    cin >> n;
    for(int i = 0; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 0; i < n; i++){
        cin >> b[i];
    }
    sort(b, b + n);
    for(int i = 0; i <= n; i++){
        vector<int> ad;
        ad.reserve(n);
        for(int j = 0; j <= n; j++){
            if(i == j)
                continue;
            ad.push_back(a[j]);
        }
        sort(ad.begin(), ad.end());
        int maxn = 0;
        for(int j = 0; j < n; j++){
            maxn = max(maxn, ad[j] - b[j]);
        }
        cout << maxn << '\n';
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 0 / 91