제출 #1195960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1195960		jasonic	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	196 ms	14712 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)

int main() {
    fastIO;
    
    int n; cin >> n;
    vector<pair<int, int>> ties(n+1);
    vector<int> people(n);
    multiset<int> times;
    
    for(int i = 0; i < n+1; i++) {
        cin >> ties[i].first;
        ties[i].second = i;
    }
    for(int i = 0; i < n; i++) cin >> people[i];

    sort(ties.begin(), ties.end());
    sort(people.begin(), people.end());

    vector<int> ans(n+1, 0);

    for(int i = 0; i < n; i++) {
        times.emplace(ties[i+1].first - people[i]);
    }

    ans[ties[0].second] = max(0, *times.rbegin());

    for(int i = 0; i < n; i++) {
        times.extract(ties[i+1].first - people[i]);
        times.emplace(ties[i].first - people[i]);
        ans[ties[i+1].second] = max(0, *times.rbegin());
    }

    for(auto i : ans) cout << i << ' ';
    
    return 0;
}

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