oj.uz

Submission #996519

# Submission time Handle Problem Language Result Execution time Memory
996519 2024-06-10T18:24:04 Z makrav Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define pb push_back
#define ff first
#define sc second
#define pii pair<int, int>
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n + 1), b(n);
    for (int i = 0; i < n + 1; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    sort(all(a));
    sort(all(b));
    vector<int> pref(n+1), suff(n+1);
    for (int i = 1; i <= n; i++) {
        pref[i] = max(pref[i - 1], a[i - 1] - b[i - 1]);
        suff[i] = max(suff[i - 1], a[n + 1 - i] - b[n - i]);
    }
    for (int i = 0; i <= n; i++) {
        cout << max(pref[i], suff[n - i]) << ' ';
    }
    cout<<'\n';

    return 0;
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -