Submission #590718

#	Time	Username	Problem	Language	Result	Execution time	Memory
590718		ioi	Just Long Neckties (JOI20_ho_t1)	C++14	9 / 100	1041 ms	8764 KiB

ho_t1

#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long

#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);

#define int ll

const int N =  2003,  M = N * 4  , MX = 2e4 + 40;
const ll MOD = 998244353  , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};



int32_t main()
{
    // inF;
   // inF;outF;
    fastio;

    //Welcome back without <TAWJIHI>


   int n ;
   cin >> n ;
   vector<int> a(n + 1) , b(n);

   for(auto &it : a)cin >> it ;


   for(auto &it : b)cin >> it ;

   sort(b.begin() , b.end());

   for(int i = 0 ; i <= n ; i ++){
      vector<int> tmp ;
    int j = 0 ;
    while(j < i)tmp.push_back(a[j++]);
    j = i + 1 ;

    while(j <= n)tmp.push_back(a[j ++ ]);

    sort(tmp.begin() , tmp.end());

    int ans = 0 ;

    for(int i = 0 ; i < n ; i ++)ans = max(ans , tmp[i] - b[i]);
        cout << ans << " " ;
   }


}

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