제출 #1220970

#제출 시각아이디문제언어결과실행 시간메모리
1220970putuputuJust Long Neckties (JOI20_ho_t1)C++20
0 / 100
0 ms320 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    int n;
    cin >> n;
    vector<int> a(n+1);
    vector<int> b(n);
    for(int i=0; i<n+1; i++){
        cin >> a[i];
    }
    for(int i=0; i<n; i++){
        cin >> b[i];
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector<int> pf(n+1, 0LL);
    for(int i=0; i<n; i++){
        pf[i+1]=max(pf[i], max(0LL, a[i]-b[i]));
    }
    vector<int> sf(n+1, 0LL);
    for(int i=n-1; i>=0; i--){
        sf[i]=max(sf[i+1], max(0LL, a[i+1]-b[i]));
    }
    for(int i=0; i<=n; i++){
        cout << max(pf[i], sf[i]) << " ";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...