#include "teams.h"
#include <vector>
#include <set>
#include <algorithm>
#include <utility>
#include <queue>
#include <iostream>
using namespace std;
vector<pair<int, int> > intervals;
void init(int N, int A[], int B[]) {
for (int i = 0; i < N; i++){
intervals.push_back(make_pair(A[i], B[i]));
}
sort(intervals.begin(), intervals.end());
}
int can(int M, int K[]) {
vector<long long> projects;
for (int i = 0; i < M; i++){
projects.push_back(K[i]);
}
sort(projects.begin(), projects.end());
priority_queue<pair<int, int> > interval_queue;
int c_student = 0;
for (int i = 0; i < M; i++){
int to_fill = K[i];
while (intervals[c_student].first <= K[i]){
interval_queue.push(make_pair(-intervals[c_student].second, intervals[c_student].first));
c_student++;
}
while (to_fill > 0 && !interval_queue.empty()){
pair<int, int> f = interval_queue.top();
//cout << f.first << ' ' << f.second << endl;
interval_queue.pop();
if (-f.first >= K[i]){
to_fill--;
}
}
if (to_fill != 0){
//cout << 0 << endl;
return 0;
}
}
// cout << 1 << endl;
return 1;
}
