제출 #1136749

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

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
#define vodka void
int main(){
    ll n;
    cin >> n;
    ll b[n+1];
    pair<ll,ll> a[n+2];
    for(ll i = 0; i < n+1; i++){
        cin >> a[i].ff;
        a[i].ss = i;
    }
    for(ll i = 0; i < n; i++)cin >> b[i];
    sort(a,a+n+1);
    sort(b,b+n);
    vector<ll>ans(n+5);
    multiset<ll,greater<ll>>st;
    for(ll i = 0; i < n; i++)st.insert(a[i].ff - b[i]);
    ans[a[n].ss]=*st.begin();
    for(ll i = n-1; i >= 0; i--){
        st.erase(st.find(a[i].ff - b[i]));
        st.insert(a[i+1].ff - b[i]);
        ans[a[i].ss]=*st.begin();
    }
    for(ll i = 0; i <= n; i++)cout << max(0ll, ans[i]) << '\n';
}

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