区间k大数查询 --排序

区间k大数查询 --排序

// An highlighted block
package 算法训练;
import java.util.Arrays;
import java.util.Scanner;
public class MainAlo1 {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int a[]=new int[n];
		//输入数据
		for(int i=0;i<n;i++) {
			a[i]=in.nextInt();
		}
		int m = in.nextInt();
		while(m>0) {
			int l=in.nextInt();
			int r=in.nextInt();
			int k=in.nextInt();
			int length=r-l+1;
			int b[]=new int[length];
			for(int i=l;i<=r;i++) {
				b[i-l]=a[i-1];
			}
			Arrays.sort(b);//默认升序
			System.out.println(b[length-k]);			
			m--;
		}		
	}
}