#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
edi
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "teams.h"
template<typename T>
struct segtree {
// https://codeforces.com/blog/entry/18051
/*=======================================================*/
struct data {
vector<int> a;
};
data neutral = {};
data merge(data &left, data &right) {
data curr;
auto &a = left.a, &b = right.a, &c = curr.a;
int ptr1 = 0, ptr2 = 0;
while(ptr1 < sz(a) and ptr2 < sz(b)){
if(a[ptr1] < b[ptr2]){
c.pb(a[ptr1++]);
}
else{
c.pb(b[ptr2++]);
}
}
while(ptr1 < sz(a)) c.pb(a[ptr1++]);
while(ptr2 < sz(b)) c.pb(b[ptr2++]);
return curr;
}
void create(int i, T v) {
tr[i].a = v;
}
void modify(int i, T v) {
}
/*=======================================================*/
int n;
vector<data> tr;
segtree() {
}
segtree(int siz) {
init(siz);
}
void init(int siz) {
n = siz;
tr.assign(2 * n, neutral);
}
void build(vector<T> &a, int siz) {
rep(i, siz) create(i + n, a[i]);
rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
}
void pupd(int i, T v) {
modify(i + n, v);
for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
}
int query(int l, int r, int mn) {
int res = 0;
for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
// if (l & 1) resl = merge(resl, tr[l++]);
// if (!(r & 1)) resr = merge(tr[r--], resr);
if(l&1){
auto &v = tr[l++].a;
res += v.end()-lower_bound(all(v),mn);
}
if(!(r&1)){
auto &v = tr[r--].a;
res += v.end()-lower_bound(all(v),mn);
}
}
return res;
}
};
int n;
vector<int> a(N);
vector<int> b(N);
segtree<vector<int>> st;
void init(int n_, int A[], int B[]) {
n = n_;
rep(i,n) a[i] = A[i], b[i] = B[i];
vector<vector<int>> here(n+1);
rep(i,n) here[a[i]].pb(b[i]);
st = segtree<vector<int>>(n+1);
st.build(here,n+1);
}
int can(int m, int K[]) {
int sum = 0;
rep(i,m){
sum += K[i];
if(sum > n){
return 0;
}
}
sort(K,K+m);
vector<pii> c;
c.pb({K[0],K[0]});
rep1(i,m-1){
if(K[i] == K[i-1]){
c.back().ss += K[i];
}
else{
c.pb({K[i],K[i]});
}
}
auto get = [&](int mnl, int mxl, int mnr){
return st.query(mnl,mxl,mnr);
// int cnt = 0;
// rep(i,n){
// if(a[i] >= mnl and a[i] <= mxl and b[i] >= mnr){
// cnt++;
// }
// }
// return cnt;
};
c.insert(c.begin(),{0,0});
m = sz(c);
vector<int> dp(m,inf1);
dp[0] = 0;
rep1(i,m-1){
rep(j,i){
amin(dp[i],dp[j]+get(c[j].ff+1,c[i].ff,c[i].ff));
}
dp[i] -= c[i].ss;
}
int mn = *min_element(all(dp));
return mn >= 0;
}
