Algo1 算法训练 区间k大数查询
题目如下:
这题没啥说头,也只能暴力点解决,就是取子数组,然后排序,最后按要求取数
package algo;
import java.util.Arrays;
import java.util.Scanner;
/**
* @Description: 算法训练 区间k大数查询
* @ClassName: Algo1
* @author: fan.yang
* @date: 2020/07/24 17:21
*/
public class Algo1 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] array = new int[n];
for(int i = 0;i < n;i++){
array[i] = scanner.nextInt();
}
int m = scanner.nextInt();
while(m-- > 0){
//取子数组
int[] newArray = Arrays.copyOfRange(array , scanner.nextInt() - 1, scanner.nextInt());
//排序
Arrays.sort(newArray);
//按要求取数
System.out.println(newArray[newArray.length - scanner.nextInt()]);
}
}
}