oj.uz

Submission #1105115

# Submission time Handle Problem Language Result Execution time Memory
1105115 2024-10-25T12:33:17 Z toast12 Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int> a(n+1), b(n);
    for (int i = 0; i <= n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    vector<int> c(n+1);
    multiset<int> diff;
    for (int i = 0; i < n; i++) diff.insert(abs(a[i+1]-b[i]));
    c[0] = *diff.rbegin();
    for (int i = 0; i < n; i++) {
        diff.erase(diff.find({a[i+1]-b[i]}));
        diff.insert(abs(a[i]-b[i]));
        c[i+1] = *diff.rbegin();
    }
    for (int i = 0; i <= n; i++) cout << c[i] << ' ';
    cout << '\n';
    return 0;
}

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 -