제출 #961681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
961681		VMaksimoski008	Just Long Neckties (JOI20_ho_t1)	C++14	9 / 100	1058 ms	6980 KiB

ho_t1

#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<pii> a(n+1); int id = 0;
    vector<int>  b(n), ans(n+1);
    for(auto &x : a) cin >> x.first, x.second = id++;
    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, j=0, k=0;
        while(j < n + 1 && k < n) {
            if(j == i) {
                j++;
                continue;
            }
            curr = max(curr, max(a[j].first - b[k], 0));
            j++, k++;
        }
        ans[a[i].second] = curr;
    }

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

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