Submission #1023607

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023607		vjudge1	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	1022 ms	8840 KiB

ho_t1

#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define FOR(i,n) for(int i=0;i<n;i++)
#define ROF(i,m,n) for(int i=m;i<=n;i++)
#define vi vector<int>
#define pb push_back
#define alle(a) a.begin(),a.end()
#define rall(n) rbegin(n),rend(n)
#define int long long
#define vecs vector<int> 
#define ll long long
#define ss second 
#define ff first
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
const int N = 2005;

void solve(){
    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];
    }
    for(int i = 0; i <= n; i++){
        vector<int> c = a;
        c.erase(c.begin() + i);
        sort(c.begin(), c.end());
        sort(b.begin(),b.end());
        int mx = 0;
        for(int j = 0; j < n; j++){
            int h = 0;
            int y = max(c[j] - b[j],h);
            mx = max(y, mx);
        }
        cout << mx << " ";
    }
    cout << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1;
    while (t--) {
        solve();
    }
    return 0;
}

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