poj 2104 K

#include <stdio.h>#include <algorithm>#include <string.h>#include <string.h>#include <stdlib.h>#define N 100000struct node{    int x,id;}node[N];int cmp(void const*a,void const*b){    return ((struct node*)a)->x-((struct node*)b)->x;}int main(){    int i,j,n,m,a,b,k;    while(~scanf("%d%d",&n,&m))    {        for(i=0;i<n;i++)        { scanf("%d",&node[i].x); node[i].id=i;        }        qsort(node,n,sizeof(node[0]),cmp);        for(i=0;i<m;i++)        { scanf("%d%d%d",&a,&b,&k); a--,b--; for(j=0;j<n;j++) {     if(node[j].id>=a&&node[j].id<=b)    k--;     if(!k)     {         printf("%dn",node[j].x);         break;     } }        }    }    return 0;}