Submission #625751

#	Time	Username	Problem	Language	Result	Execution time	Memory
625751		colossal_pepe	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	0 ms	212 KiB

ho_t1

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

int n;
vector<int> a, b, 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(a.begin(), a.end());
    sort(b.begin(), b.end());
    ans.resize(n + 1);
    int oddity = 0;
    for (int i = 0; i < n; i++) {
        oddity = max(oddity, max(a[i] - b[i], 0));
    }
    ans[n] = oddity;
    for (int i = n; i >= 1; i--) {
        oddity = max(oddity, max(a[i] - b[i - 1], 0));
        ans[i - 1] = oddity;
    }
    for (int i = 0; i < n + 1; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
    return 0;
}

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