#include <bits/stdc++.h>
#include "teams.h"
std::vector<int> a, b, k;
void init(int N, int A[], int B[]) {
a.clear();
k.clear();
std::vector<std::pair<int, int>> v;
for(int i = 0; i < N; i++) {
v.push_back({A[i], B[i]});
}
std::sort(v.begin(), v.end());
for(int i = 0; i < N; i++) {
a.push_back(v[i].first);
b.push_back(v[i].second);
}
}
int can(int M, int K[]) {
for(int i = 0; i < M; i++) {
k.push_back(K[i]);
}
std::sort(k.begin(), k.end());
int j = 0;
int ok = 1;
std::vector<int> was(a.size());
for(int i = 0; i < M; i++) {
int taken = 0;
int w = 0;
for(j = 0; j < a.size(); j++) {
if(was[j]) {
continue;
}
if(a[j] <= k[i] && b[j] >= k[i]) {
taken += 1;
was[j] = 1;
if(taken == k[i]) {
w = 1;
break;
}
}
}
ok &= w;
}
k.clear();
return ok;
}
