主席树HDU2665，区间第k小。

#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e5 + 7;
struct node
{
    int lc, rc, v;
    node () {lc=rc=v=0;}
}t[maxn*20];
int tot;
int a[maxn];
int b[maxn];
int rt[maxn];
int build(int l, int r)
{
    int now = ++ tot;
    t[now].lc = t[now].rc = t[now].v = 0;
    if(l == r) return now;
    int mid = (l + r) >> 1;
    t[now].lc = build(l, mid);
    t[now].rc = build(mid+1, r);
    return now;
}
int insert(int last, int l, int r, int pos)
{
    int now = ++ tot;
    t[now] = t[last];
    t[now].v ++;
    if(l == r) return now;
    int mid = (l + r) >> 1;
    if(pos <= mid) t[now].lc = insert(t[last].lc, l, mid, pos);
    else t[now].rc = insert(t[last].rc, mid+1, r, pos);
    return now;
}
int query(int st, int ed, int l, int r, int k) // k_th_element
{
    if(l == r) return l;
    int num = t[ t[ed].lc ].v - t[ t[st].lc ].v;
    int mid = (l + r) >> 1;
    if(k <= num) return query(t[st].lc, t[ed].lc, l, mid, k);
    return query(t[st].rc, t[ed].rc, mid+1, r, k - num);
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T --) {
        tot = 0;
        int n, Q;
        scanf("%d %d", &n, &Q);
        rt[0] = build(1, n);
        for(int i = 1;i <= n;i ++) scanf("%d", &a[i]), b[i] = a[i];
        sort(b+1, b+1+n);
        for(int i = 1;i <= n;i ++) a[i] = lower_bound(b+1, b+1+n, a[i]) - b;
        for(int i = 1;i <= n;i ++) rt[i] = insert(rt[i-1], 1, n, a[i]);
        while(Q --) {
            int l, r, k;
            scanf("%d %d %d", &l, &r, &k);
            int idx = query(rt[l-1], rt[r], 1, n, k);
            printf("%d\n", b[idx]);
        }
    }
    return 0;
}