蓝桥杯 - 区间k大数查询

题目传送：蓝桥杯 - 区间k大数查询

思路：取出来排个序即可

AC代码：

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n, m;int a[1005];int main() {while(scanf("%d", &n) != EOF) {for(int i = 1; i <= n; i++) {scanf("%d", &a[i]);}scanf("%d", &m);for(int cnt = 0; cnt < m; cnt++) {int l, r, k;int tmp[1005];scanf("%d %d %d", &l, &r, &k);for(int j = l; j <= r; j++) {tmp[j - l + 1] = a[j];}int sum = r - l + 1;sort(tmp + 1, tmp + sum + 1);//for(int i = 1; i <= sum; i++) printf("%d ", tmp[i]);printf("%d\n", tmp[sum - k + 1]);}}return 0;}