Submission #1063808

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063808		BlueGlaucus1	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	0 ms	348 KiB

ho_t1

#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int n; cin >> n;
    int prefix[n+1];
    int suffix[n+1];
    int a[n+1];
    int b[n];
    prefix[0] = 0;
    suffix[0] = 0;
    
    for(int i =1; i <=n+1;i++){
        cin >> a[i];
    }for(int i =1; i <=n;i++){
        cin >> b[i];
    }
    sort(a, a+n+2);
    sort(b, b+n+1);
    int maxi = 0;
    for(int i = 0; i <n;i++){
        maxi = max(maxi,max(0,a[i]-b[i]));
        prefix[i] = maxi;
    }
    maxi = 0;
    for(int i = 0; i <n;i++){
        maxi = max(maxi,max(0,a[n-i]-b[n-i-1]));
        suffix[i] = maxi;
    }
    for(int i = 1; i <=n+1;i++){
        cout << max(suffix[i], prefix[i-1])<< " ";
    }
    return 0;
}

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