#include "teams.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
pair<int,int> v[500005];
void init(int32_t N, int32_t A[], int32_t B[])
{
n=N;
for(int i=0;i<N;i++)
{
v[i] = {A[i],B[i]};
}
}
int numara(int le, int ri)
{
int cv=0;
for(int i=0;i<n;i++)
if(v[i].first <= le && v[i].second >= ri)
cv++;
return cv;
}
const int MAXV = 1000;
int inc[MAXV+5][MAXV+5],cate[MAXV+5][MAXV+5];
int32_t can(int32_t M, int32_t K[])
{
int tot=0;
for(int i=0;i<M;i++)
tot += K[i];
if(tot > n)
return 0;
sort(K,K+M);
vector<pair<int,int>> aux;
for(int i=0;i<M;i++)
{
if(!aux.empty() && K[i]==aux.back().first)
aux.back().second += K[i];
else
aux.push_back({K[i],K[i]});
}
assert((int)aux.size() <= MAXV);
for(int i=0;i<aux.size();i++)
{
for(int j=i;j<aux.size();j++)
{
inc[i][j] = numara(aux[i].first, aux[j].first);
}
}
for(int i=0;i<aux.size();i++)
{
for(int j=i;j<aux.size();j++)
{
cate[i][j] = inc[i][j];
if(i>0) cate[i][j] -= inc[i-1][j];
if(j+1<aux.size()) cate[i][j] -= inc[i][j+1];
if(i>0 && j+1<aux.size()) cate[i][j] += inc[i-1][j+1];
}
}
multiset<pair<int,int>> s;
for(int i=0;i<aux.size();i++)
{
while(!s.empty() && (*s.begin()).first < i)
s.erase(s.begin());
for(int j=i;j<aux.size();j++)
if(cate[i][j]>0)
s.insert({j,cate[i][j]});
int ramase = aux[i].second;
while(ramase>0)
{
if(s.empty())
return 0;
auto it = s.begin();
pair<int,int> x = *it;
assert(x.first >= i);
int d = min(ramase, x.second);
ramase -= d;
x.second -= d;
if(x.second > 0)
{
s.erase(it);
s.insert(x);
break;
}
else
{
s.erase(it);
}
}
}
return 1;
}
