#include <bits/stdc++.h>
#include "teams.h"
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
int l[200015],r[200015],n;
vector<pii>all;
void init(int N, int A[], int B[]) {
n=N; all.clear();
for (int i=1;i<=n;i++){
l[i]=A[i-1];
r[i]=B[i-1];
all.push_back({l[i],r[i]});
}
sort(all.begin(),all.end());
}
int can(int M, int K[]) {
multiset<int>st;
sort(K,K+M);
int p=0;
for (int i=0;i<M;i++){
while (p<n&&all[p].x<=K[i])
st.insert(all[p++].y);
while (!st.empty()&&(*st.begin())<K[i])
st.erase(st.begin());
for (int j=0;j<K[i];j++){
if (st.empty()) return 0;
st.erase(st.begin());
}
}
return 1;
}
