oj.uz

Submission #1108284

# Submission time Handle Problem Language Result Execution time Memory
1108284 2024-11-03T16:39:19 Z overwatch9 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
    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(b.begin(), b.end());
    vector <int> a2 = a;
    sort(a2.begin(), a2.end());
    multiset <int> d;
    for (int i = 1; i < n+1; i++) {
        d.insert(max(0, a2[i] - b[i-1]));
    }
    cout << *d.rbegin() << ' ';
    for (int i = 0; i < n; i++) {
        d.insert(max(0, a2[i] - b[i]));
        d.erase(d.find(max(0, a2[i+1] - b[i])));
        cout << *d.rbegin() << ' ';
    }

    cout << '\n';
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 91.0

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