#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define F first
#define S second
const int MAXN = 500005;
int n;
pii a[MAXN];
void init(int N, int A[], int B[]){
n = N;
for(int i = 0; i < n; i ++){
a[i] = {A[i],B[i]};
}
sort(a,a+n);
}
int can(int M, int K[]) {
sort(K,K+M);
int cur = 0;
for(int i = 0; i < M; i ++){
cout << i << " " << cur << endl;
int lim = (int)(upper_bound(a,a+n,make_pair(K[i]+1,-1))-a)-1;
int cnt = 0;
for(int j = cur; j <= lim; j++){
if(a[j].S >= K[i]) cnt++;
if(cnt == K[i]){
cur = j+1;
break;
}
}
// cout << i << " " << cur << endl;
if(cnt != K[i]) return 0;
}
return 1;
}
