区间K大数查找 Java 蓝桥杯ALGO-1

 1 import java.util.Arrays;
 2 import java.util.Scanner;
 3 
 4 public class Main {
 5     public static void main(String[] args) {
 6     Scanner aScanner = new Scanner(System.in);
 7     int n= aScanner.nextInt();   //读第一个
 8     long a[] = new long[n];      //存放数组
 9     long b[] = new long[n];      //备用数组
10     
11     for(int i=0;i<n;i++)
12     {
13         a[i] = aScanner.nextInt();
14     }
15     int m = aScanner.nextInt();
16     int []l = new int[1001];
17     int []r = new int[1001];
18     int []k = new int[1001];
19     for(int i=0;i<m;i++)
20     {
21         l[i] = aScanner.nextInt();
22         r[i] = aScanner.nextInt();
23         k[i] = aScanner.nextInt();
24         for(int j=l[i]-1;j<r[i];j++)
25         {
26             b[j-l[i]+1] = a[j];
27         }
28         Arrays.sort(b);
29         System.out.println(b[b.length-k[i]]);
30         Arrays.fill(b, ‘\0‘);
31         
32     }
33     }
34 }