Submission #625747

#	Time	Username	Problem	Language	Result	Execution time	Memory
625747		colossal_pepe	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	1079 ms	7248 KiB

ho_t1

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector<int> a, b;

int solve(int ceo) {
    vector<int> c;
    for (int i = 0; i < n + 1; i++) {
        if (i != ceo) c.push_back(a[i]);
    }
    sort(c.begin(), c.end());
    int ans = 0;
    for (int i = 0; i < n; i++) {
        ans = max(ans, max(c[i] - b[i], 0));
    }
    return ans;
}

int main() {
    cin >> n;
    a.resize(n + 1), b.resize(n);
    for (int i = 0; i < n + 1; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    sort(b.begin(), b.end());
    for (int i = 0; i < n + 1; i++) {
        cout << solve(i) << ' ';
    }
    cout << '\n';
    return 0;
}

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