Java蓝桥杯--算法训练（1）区间K最大数查询

关键词：

排序 查找

题目：

解决方法：

package package1;

import java.util.Scanner;  


public class test {  
  
    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();  
        int output[] = new int[m];  
       
        //输入L,R,K
        for (int i = 0; i < m; i++) {  
            int l = in.nextInt();  
            int r = in.nextInt();  
            int k = in.nextInt();  
            
            int K[] = new int[r - l + 1];
            
            
            for (int j = l - 1; j < r; j++) {  
                K[j + 1 - l] = A[j];  
            }  
         
            //排序
            for (int j = 0; j < K.length; j++) {  
                for (int j1 = j; j1 < K.length; j1++) {  
                    if(K[j1]>K[j]){  
                        int swap = K[j1];  
                        K[j1]= K[j];  
                        K[j] = swap;  
                    }  
                }  
            }  
            
            output[i] = K[k-1];  
        }  
        
        for (int i = 0; i < m; i++) {  
            System.out.println(output[i]);  
        }  
    }  
}