oj.uz

Submission #361449

# Submission time Handle Problem Language Result Execution time Memory
361449 2021-01-30T08:37:24 Z l3nl3 Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h> 

using namespace std;

const int mxsz = 2e5 + 7;

int n, a[mxsz], b[mxsz];
priority_queue<int> q;

int main () {
    cin >> n;
    for (int i = 1; i <= n+1; i++) {
        cin >> a[i];
    }
    for (int j = 1; j <= n; j++) {
        cin >> b[j];
    }
    sort(a+1, a+n+1+1);
    sort(b+1, b+n+1);
    reverse(b+1, b+n+1);
    int r = n+1;
    for (int i = 1; i <= n; i++) {
        q.push(max(a[r--] - b[i], 0));
    }
    r = n;
    for (int i = 1; i <= n+1; i++) {
        cout << q.top() << ' ';
        if (i != n+1) {
            priority_queue<int> q_2;
            bool f = 1;
            while (!q.empty()) {
                if (f) {
                    if (q.top() != a[i+1] - b[r]) {
                        q_2.push(q.top());
                    }
                    f = 0;
                } else {
                    q_2.push(q.top());
                }
                q.pop();
            }
            q = q_2;
            q.push(max(a[i] - b[r--], 0));
        }
    }
}

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 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 364 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 364 KB Output isn't correct
2 Halted 0 ms 0 KB -