算法训练 区间k大数查询

```#include <iostream>#include<cstdio>#include<algorithm>#define maxn 1005using namespace std;int aa[maxn];int a[maxn];///STL中的排序函数，降序排bool compare(int a,int b){          return a>b;}int MK(int n,int l,int r,int k){          int nn=r-l+1;          for(int j=0;j<nn;j++)          {                    a[j]=aa[l];                    l++;          }          sort(a,a+nn,compare);          return a[k-1];}int main(){    int n,m,k,r,l;    while(scanf("%d",&n)!=EOF)    {              for(int i=1;i<=n;i++)              {                        scanf("%d",&aa[i]);              }              scanf("%d",&m);              while(m--)              {                        scanf("%d %d %d",&l,&r,&k);                        printf("%d\n",MK(n,l,r,k));              }    }    return 0

注意降序排的方法