蓝桥杯 算法训练 区间k大数查询 JAVA

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int a = s.nextInt();
		int b[] = new int[a];
		for (int i = 0; i < b.length; i++) {
			b[i] = s.nextInt();
		}
		int c = s.nextInt();
		int g[] = new int[c];
		int h = 0;
		while (c > 0) {

			int d = s.nextInt();
			int e = s.nextInt();
			int f[] = new int[e - d + 1];
			for (int i = 0; i < f.length; i++) {
				f[i] = b[d - 1 + i];
			}
			Arrays.sort(f);
			g[h] = f[f.length - s.nextInt()];
			c--;
			h++;
		}
		for (int i = 0; i < g.length; i++) {
			System.out.println(g[i] + "");
		}

	}
}