算法训练 区间k大数查询 (C++)
#include <iostream>
#include <algorithm>
using namespace std;
int arr[1001], brr[1001];
bool cmp(int a, int b) {
return a > b;
}
int main() {
int n, m;
int l, r, k;
int i, j;
while(cin >> n) {
for (i=0; i<n; i++)
cin >> arr[i];
cin >> m;
while(m--) {
cin >> l >> r >> k;
for (j=l-1,i=0; j<r; j++,i++)
brr[i] = arr[j];
sort(brr,brr+i,cmp);
cout << brr[k-1] << endl;
}
}
return 0;
}