Submission #493792

#	Time	Username	Problem	Language	Result	Execution time	Memory
493792		Biaz	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	1086 ms	11432 KiB

ho_t1

#include <bits/stdc++.h>
#define int long long
#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef long long ll;
const int N=200005;
const int M=100000005;
const int MOD=998244353;//1000000007;
const int INF=2147483647;//1000000000000000;

int n;
pi a[N];
int res[N],b[N];
multiset<int>st;
inline void sol(){
    cin >>n;
    for (int i=1;i<=n+1;i++)
        cin >>a[i].fi,a[i].se=i;
    for (int i=1;i<=n;i++)
        cin >>b[i];
    sort(a+1,a+n+2);sort(b+1,b+n+1);
    for (int i=1,j;i<=n+1;i++){
        j=1;
        vector<int> c(n+2);
        for (int k=1;k<=n+1;k++)
            if (k!=i)
                c[j++]=a[k].fi;
        int re=0;
        for (int k=1;k<=n;k++)
            re=max(re,max(0,c[k]-b[k]));
        res[a[i].se]=re;
    }
    for (int i=1;i<=n+1;i++)
        cout <<res[i]<<' ';

}
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

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