제출 #1267230

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267230		gay	Just Long Neckties (JOI20_ho_t1)	C++20	9 / 100	1095 ms	6968 KiB

ho_t1

#include <bits/stdc++.h>
#include <experimental/random>
#include <random>

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

const ll INF = 1e18, MOD = 998244353;

void solve();

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll q = 1;
    //cin >> q;
    while (q--) {
        solve();
    }
}

void solve() {
    ll n;
    cin >> n;
    vector<ll> a(n + 1);
    for (int i = 0; i <= n; i++) {
        cin >> a[i];
    }
    vector<ll> b(n);
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    sort(b.begin(), b.end());
    for (int i = 0; i <= n; i++) {
        vector<ll> c;
        for (int j = 0; j <= n; j++) {
            if (i != j) {
                c.push_back(a[j]);
            }
        }
        sort(c.begin(), c.end());
        ll ans = 0;
        for (int j = 0; j < n; j++) {
            ans = max(ans, c[j] - b[j]);
        }
        cout << ans << ' ';
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 0 / 91