#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <random>
#include "teams.h"
using namespace std;
#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
#define pb push_back
#define chmin(x, y) (x = min(x, y))
#define chmax(x, y) (x = max(x, y))
/********* DEBUG *********/
template <typename T>
void outvec(const vector<T>& Z){
for (const T& x : Z)
cout << x << ' ';
cout << "\n";
}
void printVariable(const any& var) {
if (!var.has_value()) {
cout << "null";
return;
}
if (var.type() == typeid(int)) {
cout << any_cast<int>(var);
} else if (var.type() == typeid(double)) {
cout << any_cast<double>(var);
} else if (var.type() == typeid(float)) {
cout << any_cast<float>(var);
} else if (var.type() == typeid(char)) {
cout << any_cast<char>(var);
} else if (var.type() == typeid(bool)) {
cout << (any_cast<bool>(var) ? "true" : "false");
} else if (var.type() == typeid(string)) {
cout << any_cast<string>(var);
} else if (var.type() == typeid(const char*)) {
cout << any_cast<const char*>(var);
} else if (var.type() == typeid(long long)) {
cout << any_cast<long long>(var);
} else {
cout << "[unknown type]";
}
}
template<typename... Args>
void outval(Args... args) {
vector<any> variables = {args...};
for (size_t i = 0; i < variables.size(); ++i) {
printVariable(variables[i]);
if (i != variables.size() - 1) {
cout << " ";
}
}
cout << "\n";
}
#define sp << " " <<
#define fi first
#define se second
/********* DEBUG *********/
const ll MOD2 = 1e9 + 7;
const ll MOD = 998244353;
const ll inf = 1e18;
vector<pair<int,int>> childs;
int n;
void init(int N, int A[], int B[]) {
childs.resize(N);
for (int i = 0; i < N; i++){
childs[i] = {A[i], B[i]};
}
n = N;
sort(all(childs));
}
int can(int M, int K[]) {
vector<int> teams;
for (int i = 0; i < M; i++){
teams.pb(K[i]);
}
sort(all(teams));
priority_queue<ll, vector<ll>, greater<>> open;
ll p = 0;
for (int i = 0; i < M; i++){
while (p < n && childs[p].first <= teams[i])
open.push(childs[p++].second);
while (open.size() && open.top() < teams[i])
open.pop();
ll have = 0;
while (have < teams[i] && open.size()){
have++;
open.pop();
}
if (have < teams[i])
return 0;
}
return 1;
}
