oj.uz

Submission #961677

# Submission time Handle Problem Language Result Execution time Memory
961677 2024-04-12T10:09:17 Z VMaksimoski008 Just Long Neckties (JOI20_ho_t1) C++14
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n;
    cin >> n;

    vector<int> a(n+1), b(n), ans(n+1);
    for(int &x : a) cin >> x;
    for(int &x : b) cin >> x;
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    for(int i=0; i<n+1; i++) {
        int curr = 0;
        int j=0, k=0;
        while(j < n + 1 && k < n) {
            if(j == i) {
                j++;
                continue;
            }
            curr = max(curr, max(a[j] - b[k], 0));
            j++, k++;
        }
        ans[i] = curr;
    }

    for(int &x : ans) cout << x << " ";
    return 0;
}

Subtask #1
0 / 1.0

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