#include "teams.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
PII arr[MAXN];
int n;
void init(int N, int A[], int B[]) {n=N;
for(int i=0;i<n;i++)arr[i]=mp(B[i],A[i]);
sort(arr,arr+n);
}
int can(int M, int K[]) {
priority_queue<PII>q;
sort(K,K+M);int p=0;
for(int i=0,j;i<M;i++){
while(p<n and arr[p].ff<K[i])p++;
for(j=0;!q.empty() and j<K[i];j++){
PII nd=q.top();q.pop();
if(nd.ss<K[i])j--;
}
for(;p<n and j<K[i];j++){
if(arr[p].ss>K[i]){
j--;q.push(mp(-arr[p].ss,arr[p].ff));
}
p++;
}
if(j!=K[i])
return 0;
}
return 1;
}
