제출 #726474

#제출 시각아이디문제언어결과실행 시간메모리
726474vjudge1Just Long Neckties (JOI20_ho_t1)C++17
9 / 100
1071 ms9140 KiB
#include <bits/stdc++.h>
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define sts stable_sort
using namespace std;

const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n; cin >> n;
    vector<ll> v(n + 1);
    vector<ll> asd(n + 1);
    vector<ll> b(n);

    for(int i = 0; i <= n; i++){
        cin >> v[i];
        asd[i] = v[i];
    }
    sts(v.B, v.E);

    for(int i = 0; i < n; i++){
        cin >> b[i];
    }
    sts(b.B, b.E);
    vector<ll> ans;

    for(int i = 0; i <= n; i++){
        ll aux = asd[i], maxi = 0;
        int j = 0;
        for(int i = 0; i <= n; i++){
            if(v[i] == aux)continue;
            else{
                ll x = v[i] - b[j];
                if(x > 0){
                    maxi = max(maxi, x);
                }
                j++;
            }
        }
        ans.pb(maxi);
    }

    for(auto &x : ans){
        cout << x << " ";
    }cout << "\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...