#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "teams.h"
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5e5 + 10;
int n;
int root[N];
struct node {
int lhs, rhs;
int cnt;
} st[N * 40];
int nNode = 0;
int add(int id, int L, int R, int i) {
if (L == R) {
st[++nNode] = st[id];
++st[nNode].cnt;
return nNode;
}
int cur = ++nNode;
st[cur] = st[id];
int mid = L + R >> 1;
if (i <= mid) st[cur].lhs = add(st[id].lhs, L, mid, i);
else st[cur].rhs = add(st[id].rhs, mid + 1, R, i);
st[cur].cnt = st[st[cur].lhs].cnt + st[st[cur].rhs].cnt;
return cur;
}
int get(int id, int L, int R, int u, int v) {
if (u > R || L > v) return 0;
if (u <= L && R <= v) return st[id].cnt;
int mid = L + R >> 1;
return get(st[id].lhs, L, mid, u, v) + get(st[id].rhs, mid + 1, R, u, v);
}
void init(int _n, int A[], int B[]) {
n = _n;
vector <vector <int>> s(n + 1);
for (int i = 0; i < n; ++i) s[B[i]].push_back(A[i]);
for (int i = 1; i <= n; ++i) {
int r = root[i - 1];
for (auto val: s[i]) r = add(r, 1, n, val);
root[i] = r;
}
}
int cnt[N];
int can(int m, int x[]) {
map <int, int> mp;
long long tot = 0;
for (int i = 0; i < m; ++i) tot += x[i];
if (tot > n) return 0;
for (int i = 0; i < m; ++i) mp[x[i]] += x[i];
vector <int> List;
for (auto [x, need]: mp) List.push_back(x);
List.push_back(n + 1);
for (int i = 0; i < List.size() - 1; ++i) cnt[i] = 0;
for (int i = 0; i + 1 < List.size(); ++i) {
int need = mp[List[i]];
for (int j = i; j + 1 < List.size(); ++j) {
int cur = get(root[List[j + 1] - 1], 1, n, 1, List[i]) - get(root[List[j] - 1], 1, n, 1, List[i]);
cur -= cnt[j];
int delta = min(cur, need);
need -= delta;
cnt[j] += delta;
if (need == 0) break;
}
if (need != 0) return 0;
}
return 1;
}
