제출 #207023

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207023		Saboon	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	382 ms	14816 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
 
typedef pair <int, int> pii;
 
const int maxn = 2e5 + 2;
int ans[maxn], b[maxn];
pii a[maxn];
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i <= n; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a, a + n + 1);
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    sort(b, b + n);
    multiset <int> S;
    for (int i = 1; i <= n; i++) {
        S.insert(a[i].first - b[i - 1]);
//      cout << a[i].first << ' ' << b[i - 1] << endl;
    }
    ans[a[0].second] = *S.rbegin();
    for (int i = 1; i <= n; i++) {
        S.erase(S.find(a[i].first - b[i - 1]));
        S.insert(a[i - 1].first - b[i - 1]);
        ans[a[i].second] = *S.rbegin();
    }
    for (int i = 0; i <= n; i++)
        cout << ans[i] << ' ';
}

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