#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>a, b;
int n;
void init (int N, int A[], int B[]) {
a = vector<int>(A, A+n);
b = vector<int>(B, B+n);
int n = N;
}
vector<int>kk;
vector<int>visited(n, 0);
int can (int m, int k[]) {
kk = vector<int>(k, k+m);
sort(kk.begin(), kk.end());
for(int i=0;i<m;i++){
int r = kk[i];
int rr = r;
//priority_queue<pair<int,int>> q;
vector<int>aaasi;
for(int j=0;j<n;j++) if (a[j] <= r) aaasi.push_back(j);
//Sort
sort(aaasi.begin(),aaasi.end(), [&](ll l, ll r) {
return b[r] < b[r];
});
for(auto valido: aaasi){
if(rr > b[valido] or visited[valido]) continue;
r--;
visited[valido] = true;
if(r<=0) break;
}
if(r > 0) return 0;
}
return 1;
}
