제출 #1108285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1108285		overwatch9	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	298 ms	20296 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector <pair <int, int>> a(n+1);
    vector <int> b(n);
    for (int i = 0; i < n+1; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i = 0; i < n; i++)
        cin >> b[i];
    sort(b.begin(), b.end());
    vector <pair <int, int>> a2 = a;
    sort(a2.begin(), a2.end());
    multiset <int> d;
    for (int i = 1; i < n+1; i++) {
        d.insert(max(0, a2[i].first - b[i-1]));
    }
    vector <int> ans(n+1);
    ans[a2[0].second] = *d.rbegin();
    for (int i = 0; i < n; i++) {
        d.insert(max(0, a2[i].first - b[i]));
        d.erase(d.find(max(0, a2[i+1].first - b[i])));
        ans[a2[i+1].second] = *d.rbegin();
    }
    for (int i = 0; i < n+1; i++)
        cout << ans[i] << ' ';
    cout << '\n';
}

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