제출 #625770

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

ho_t1

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int n;
vector<int> b, ans;
vector<pair<int, int>> a;
 
int main() {
    cin >> n;
    a.resize(n + 1), b.resize(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(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].first - b[i], 0));
    }
    ans[a[n].second] = oddity;
    for (int i = n; i >= 1; i--) {
        oddity = max(oddity, max(a[i].first - b[i - 1], 0));
        ans[a[i - 1].second] = oddity;
    }
    for (int i = 0; i < n + 1; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
    return 0;
}

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