Submission #1014861

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014861		aufan	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	81 ms	12368 KiB

ho_t1

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n;
        cin >> n;

        vector<int> a(n + 1);
        for (int i = 0; i < n + 1; i++) cin >> a[i];

        vector<int> b(n);
        for (int i = 0; i < n; i++) cin >> b[i];
        sort(b.begin(), b.end());

        vector<int> ord(n + 1);
        iota(ord.begin(), ord.end(), 0);
        sort(ord.begin(), ord.end(), [&](int x, int y) {
                return a[x] < a[y];
        });

        int res = 0;
        for (int i = 0; i < n; i++) {
                res = max(res, a[ord[i]] - b[i]);
        }

        vector<int> ans(n + 1);
        for (int i = n; i >= 0; i--) {
                ans[ord[i]] = res;
                if (i - 1 >= 0) res = max(res, a[ord[i]] - b[i - 1]);
        }

        for (int i = 0; i < n + 1; i++) cout << ans[i] << " \n"[i == n];
        
        return 0;
}

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