#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N=(1<<20);
const int MX=N*20;
int n;
int seg[MX], pl[MX], pr[MX], nextSeg=1;
void buildSeg(int p=0, int l=0, int r=N-1) {
seg[p] = 0;
pl[p] = -1;
pr[p] = -1;
int m=(l+r)/2;
if(l == r) return;
pl[p] = nextSeg;
buildSeg(nextSeg++, l , m);
pr[p] = nextSeg;
buildSeg(nextSeg++, m+1, r);
}
int setSeg(int i, int v, int p, int l=0, int r=N-1) {
if(i < l || i > r) return p;
if(l == r) {
seg[nextSeg] = v;
pl[nextSeg] = -1;
pr[nextSeg] = -1;
return nextSeg++;
}
int m=(l+r)/2;
pl[nextSeg] = setSeg(i,v,pl[p],l ,m);
pr[nextSeg] = setSeg(i,v,pr[p],m+1,r);
seg[nextSeg] = seg[pl[nextSeg]] + seg[pr[nextSeg]];
return nextSeg++;
}
int getSeg(int i, int j, int p, int l=0, int r=N-1) {
if(j < l || i > r) return 0;
if(i <= l && j >= r) return seg[p];
int m = (l+r)/2;
int a = getSeg(i,j,pl[p],l ,m);
int b = getSeg(i,j,pr[p],m+1,r);
return a+b;
}
int rt[MX];
vi a, b;
vi sa;
void init(int _n, int A[], int B[]) {
n = _n;
RE(i,n) a.pb(A[i]), b.pb(B[i]);
RE(i,n) sa.pb(i);
sort(all(sa),[](int i, int j) {
return a[i] < a[j];
});
int ci=0;
rt[0] = 0; buildSeg();
RE1(i,n) {
rt[i] = rt[i-1];
while(ci < n && a[sa[ci]] <= i) {
rt[i] = setSeg(b[sa[ci]], getSeg(b[sa[ci]],b[sa[ci]],rt[i])+1, rt[i]);
ci++;
}
}
}
int can(int m, int K[]) {
vi k;
RE(i,m) k.pb(K[i]);
sort(all(k));
if(true) {
priority_queue<int,vi,greater<int>> pq;
int ci = 0;
RE(i,m) {
while(ci < n && a[sa[ci]] <= k[i])
pq.push(b[sa[ci++]]);
while(!pq.empty() && pq.top() < k[i])
pq.pop();
if(pq.size() < k[i])
return 0;
RE(_,k[i]) pq.pop();
}
return 1;
}
return 0;
}
