/************************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ ┏━┛ ┆
┆ ┃ ┃ ┆
┆ ┃ ┗━━━┓ ┆
┆ ┃ AC代马 ┣┓┆
┆ ┃ ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻ ┛ ┗┻┛ ┆
************************************************ */
#pragma warning (disable:4996)
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<set>
#include<map>
//#include<regex>
#include<stack>
#include<cstdlib>
#include<functional>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
const int maxn = 1e5 + 10;
const int N = 2e6 + 100;
struct tree
{
int v, rc, lc;
}T[N];
int e;
struct node
{
int v, id, nv;
}b[maxn];
bool cmp1(const node &x, const node &y)
{
return x.v < y.v;
}
bool cmp2(const node &x, const node &y)
{
return x.id < y.id;
}
int arr[maxn];
int root[maxn];
void Insert(int pre, int cur, int p, int l, int r)
{
if (l == r)
{
T[cur].v = T[pre].v + 1;
return;
}
int m = (l + r >> 1);
if (p <= m)
{
T[cur].lc = ++e;
T[cur].rc = T[pre].rc;
Insert(T[pre].lc, T[cur].lc, p, l, m);
}
else
{
T[cur].rc = ++e;
T[cur].lc = T[pre].lc;
Insert(T[pre].rc, T[cur].rc, p, m + 1, r);
}
T[cur].v = T[T[cur].lc].v + T[T[cur].rc].v;
}
int Search(int x, int y, int k, int l, int r)
{
if (l == r) return l;
int m = (l + r >> 1);
if (T[T[y].lc].v - T[T[x].lc].v >= k) return Search(T[x].lc, T[y].lc, k, l, m);
else return Search(T[x].rc, T[y].rc, k - (T[T[y].lc].v - T[T[x].lc].v), m + 1, r);
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &b[i].v), b[i].id = i;
sort(b + 1, b + 1 + n, cmp1);
int cnt = 0;
arr[++cnt] = b[1].v;
b[1].nv = 1;
for (int i = 2; i <= n; i++) {
if (b[i].v > b[i - 1].v)
arr[++cnt] = b[i].v;
b[i].nv = cnt;
}
sort(b + 1, b + 1 + n, cmp2);
e = 0;
for (int i = 1; i <= n; i++) {
root[i] = ++e;
Insert(root[i - 1], root[i], b[i].nv, 1, cnt);
}
int x, y, k;
/*for (int i = 1; i <= cnt; i++) {
printf("%d:%d\n", i, arr[i]);
}*/
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &x, &y, &k);
//printf("%d\n", arr[Search(root[x-1],root[y], k, 1, cnt)]);
printf("%d\n", arr[Search(root[x - 1], root[y], k, 1, cnt)]);
}
return 0;
}
//10 9999
//9 89 6 99999999 88 66 77 67 66 7
//
//
//
//
//
//
06-29
197
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)