Submission #1233863

#TimeUsernameProblemLanguageResultExecution timeMemory
1233863antromancapJust Long Neckties (JOI20_ho_t1)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
int n, a[N], b[N], f[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for (int i = 1; i <= n + 1; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    sort(a + 1, a + n + 2);
    sort(b + 1, b + n + 1);
    for (int i = n; i; i--) f[i] = max(f[i + 1], a[i + 1] - b[i]);
    int cur = 0;
    b[n + 1] = 1e9;
    for (int i = 1; i <= n + 1; i++) {
        cur = max(cur, a[i] - b[i]);
        cout << max(cur, f[i]) << ' ';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...