#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "teams.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
// #define int ll
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct segment {
static const int dim = 1 << 19;
struct node {
vector<int> k;
};
vector<node> s = vector<node>(2 * dim);
int query(int pos, int l, int r, int a, int b, int k) {
if (b < l || r < a) return 0;
if (a <= l && r <= b) {
int u = lower_bound(s[pos].k.begin(), s[pos].k.end(), k) - s[pos].k.begin();
return s[pos].k.size() - u;
}
int m = (l + r) / 2;
return query(2 * pos, l, m, a, b, k) + query(2 * pos + 1, m + 1, r, a, b, k);
}
int query(int a, int b, int k) {
return query(1, 0, dim - 1, a, b, k);
}
void build(int pos, int l, int r, vector<int> &x) {
if (l == r) {
if (l < x.size()) s[pos].k.pb(x[l]);
return;
}
int m = (l + r) / 2;
build(2 * pos, l, m, x);
build(2 * pos + 1, m + 1, r, x);
s[pos].k.resize(s[2 * pos].k.size() + s[2 * pos + 1].k.size());
merge(s[2 * pos].k.begin(), s[2 * pos].k.end(), s[2 * pos + 1].k.begin(), s[2 * pos + 1].k.end(), s[pos].k.begin());
}
void build(vector<int> &x) {
build(1, 0, dim - 1, x);
}
} seg;
vector<pair<int, int>> v;
void init(int N, int A[], int B[]) {
for (int i = 0; i < N; i++) {
v.pb({A[i], B[i]});
}
sort(v.begin(), v.end());
vector<int> u;
for (auto [a, b] : v) {
u.pb(b);
}
seg.build(u);
}
int indice(int k) {
int l = 0, r = v.size() - 1;
while (l < r) {
int m = (l + r + 1) / 2;
if (v[m].fi > k)
r = m - 1;
else
l = m;
}
return l;
}
int big(int M, int K[]) {
priority_queue<int, vector<int>, greater<int>> q;
int pos = 0;
for (int i = 0; i < M; i++) {
while (pos < v.size() && v[pos].fi <= K[i]) {
q.push(v[pos].se);
pos++;
}
int rim = K[i];
while (rim) {
if (q.empty()) return 0;
int x = q.top();
q.pop();
if (x >= K[i]) rim--;
}
}
return 1;
}
int conta(int a, int b) {
int x = indice(a);
return seg.query(0, x, b);
}
int small(int M, int K[]) {
vector<int> usate(M, 0);
for (int i = 0; i < M; i++) {
vector<int> p;
for (int j = i; j < M; j++) {
p.pb(conta(K[i], K[j]));
}
int tot = 0;
for (int j = p.size() - 1; j >= 0; j--) {
p[j] -= tot;
tot += p[j];
}
for (int j = 0; j < p.size(); j++) {
p[j] -= usate[i + j];
}
int rim = K[i];
for (int j = 0; j < p.size(); j++) {
if (rim >= p[j]) {
rim -= p[j];
usate[i + j] += p[j];
p[j] = 0;
} else {
usate[i + j] += rim;
rim = 0;
break;
}
}
if (rim) return 0;
}
return 1;
}
int can(int M, int K[]) {
sort(K, K + M);
if (M < 1000)
return small(M, K);
else
return big(M, K);
}
