BZOJ 2104 K-th Number

#include<cstdio>

struct node{
int id,x;
}a[100000];
int cmp(void const*p,void const*q){
return (*(struct node*)p).x>(*(struct node*)q).x?1:-1;
}
int main(){
int n,m,x,y,k;
while (~scanf("%d%d",&n,&m)){
for (int i=0;i<n;i++){
scanf("%d",&a[i].x);
a[i].id=i;
}
qsort(a,n,sizeof(a[0]),cmp);
for (int i=0;i<m;i++){
scanf("%d%d%d",&x,&y,&k);
x--, y--;
for (int j=0;j<n;j++){
if (a[j].id>=x && a[j].id<=y) k--;
if (!k){
printf("%d\n",a[j].x);
break;
}
}
}
}
return 0;
}