第K小数
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> num;
int n,m;
int a[N];
int root[N],idx;
struct node
{
int l,r;
int cnt;
}tr[N*21];
int find(int x)
{
return lower_bound(num.begin(),num.end(),x) - num.begin();
}
int build(int l,int r)
{
int p = ++idx;
if(l == r) return p;
int mid = l + r >> 1;
tr[p].l = build(l,mid) , tr[p].r = build(mid+1,r);
return p;
}
int insert(int p,int l,int r,int x)
{
int q = ++idx;
tr[q] = tr[p];
if(l == r)
{
tr[q].cnt++;
return q;
}
int mid = l + r >> 1;
if(x <= mid) tr[q].l = insert(tr[p].l,l,mid,x);
else tr[q].r = insert(tr[p].r,mid+1,r,x);
tr[q].cnt = tr[tr[q].l].cnt + tr[tr[q].r].cnt;
return q;
}
int query(int p,int q,int l,int r,int k)
{
if(l == r) return l;
int mid = l + r >> 1;
int cnt = tr[tr[p].l].cnt - tr[tr[q].l].cnt;
if(k <= cnt) return query(tr[p].l,tr[q].l,l,mid,k);
else return query(tr[p].r,tr[q].r,mid + 1 , r, k - cnt);
}
int main()
{
cin>>n>>m;
for(int i = 1 ; i