제출 #1221183

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

ho_t1

#include <bits/stdc++.h>
#define int long long
#define pb push_backk
#define fs first
#define sc second
using namespace std;

signed main() {
    
    int n; cin >> n;
    vector<pair<int, int>> a(n + 1);
    vector<int> b(n);
    multiset<int> t;
    
    for(int i = 0; i < n + 1; i++) {
        cin >> a[i].fs;
        a[i].sc = i;
    }
    for(int i = 0; i < n; i++) cin >> b[i];

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

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

    for(int i = 0; i < n; i++) {
        t.insert(a[i+1].fs - b[i]);
    }

    ans[a[0].sc] = max(0LL, *t.rbegin());

    for(int i = 0; i < n; i++) {
        t.erase(t.find(a[i+1].fs - b[i]));
        t.insert(a[i].fs - b[i]);
        ans[a[i+1].sc] = max(0LL, *t.rbegin());
    }

    for(auto i : ans) cout << i << " ";
}

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