#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define FOR(i,a,b) for (int i = a; i<b; ++i)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)
#define SZ(x) (int)((x).size())
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<":"<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif
namespace {
const int maxn = 5e5+10;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll pref[maxn], suf[maxn];
int N;
}
void init(signed NN, signed A[], signed B[]) {
N = NN;
memset(pref, 0, sizeof pref);
memset(suf, 0, sizeof suf);
REP(i,N) {
assert(A[i] <= B[i]);
++pref[B[i]];
++suf[A[i]];
}
REP1(i,N) {
pref[i] += pref[i-1];
}
for(int i = N; i>=1; --i) {
suf[i] += suf[i+1];
}
}
signed can(signed M, signed K[]) {
bug(M);
sort(K, K+M);
vector<int> PK(M+1);
ll bad = inf;
REP(i,M) {
PK[i+1] = PK[i] + K[i];
MN(bad, N + PK[i] - pref[K[i]-1]);
int test = PK[i+1] + suf[K[i]+1];
bug(bad, test);
if (bad < test) return 0;
}
bug("good");
return 1;
}
