样例输入 5 1 2 3 4 5 2 1 5 2 2 3 2
样例输出 4 2
#include <cstdio> #include <iostream> #include <cmath> #include <string> #include <cstring> #include <algorithm> #include <queue> #include <vector> #include <map> using namespace std; #define ll long long const int inf = 0x3f3f3f3f; const int mod = 1e9+7; int n, a[1000+8], m, l, r, k, buffer[1000+8]; int main() { scanf("%d", &n); for(int i = 0; i<n; i++) scanf("%d", &a[i]); scanf("%d", &m); for(int i = 0; i<m; i++) { scanf("%d%d%d", &l, &r, &k); int id = 0; for(int j = l-1; j<r; j++) { buffer[id++] = a[j]; } sort(buffer, buffer+id, greater<int>()); printf("%d\n", buffer[k-1]); } return 0; }
原文：https://www.cnblogs.com/RootVount/p/11251436.html