Submission #1260417

#TimeUsernameProblemLanguageResultExecution timeMemory
1260417kawhietJust Long Neckties (JOI20_ho_t1)C++20
100 / 100
193 ms14728 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n + 1);
    vector<int> b(n);
    for (int i = 0; i <= n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    multiset<int> s;
    for (int i = 0; i < n; i++) {
        s.insert(max(a[i + 1].first - b[i], 0));
    }
    vector<int> ans(n + 1);
    ans[a[0].second] = *s.rbegin();
    for (int i = 0; i < n; i++) {
        s.erase(s.find(max(a[i + 1].first - b[i], 0)));
        s.insert(max(a[i].first - b[i], 0));
        ans[a[i + 1].second] = *s.rbegin();
    }
    for (int i = 0; i <= n; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...