제출 #922609

#제출 시각아이디문제언어결과실행 시간메모리
922609SuPythonyJust Long Neckties (JOI20_ho_t1)C++17
0 / 100
1 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int main() {
    int n; cin>>n;
    vector<ll> a(n+1), b(n);
    for (int i=0; i<=n; i++) cin>>a[i];
    for (int i=0; i<n; i++) cin>>b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    for (int i=0; i<=n; i++) {
        int aind=0;
        ll ans=0;
        for (int j=0; j<n; j++) {
            if (aind==i) aind++;
            ans=max(ans,max(a[aind]-b[j],0ll));
            aind++;
        }
        cout<<ans<<" ";
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...