算法训练 区间k大数查询

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

public class Main {

    public static int KSort(int[] num , int start ,int end ,int k){
        int len =end - start + 1;
        int[] tmp = new int[len];
        int cnt = 0;
        for ( int i = start-1 ; i <= end-1 ; i++){
            tmp[cnt] = num[i];
            cnt++;
        }
        Arrays.sort(tmp);
        return tmp[tmp.length-k];
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] num = new int[n];
        for ( int i = 0 ; i < n ; i++){
            num[i] = in.nextInt();
        }
        int times = in.nextInt();
        for ( int i = 0 ; i < times ; i++){
            int start = in.nextInt();
            int end = in.nextInt();
            int k = in.nextInt();
            int k_max = KSort(num, start, end, k);
            System.out.println(k_max);
        }
        in.close();
    }

}