프로그래머스-k번째 수

import java.util.*;

class Solution {
    public int[] solution(int[] array, int[][] commands) {
        int[] answer= new int[commands.length];
        int n=0;
        for(int i=0; i<commands.length; i++){
            int k=0;
            int[] list=new int[commands[i][1]-commands[i][0]+1];
            
            for(int j=commands[i][0]; j<=commands[i][1]; j++ ){
                list[k++]=array[j-1];
            }
            Arrays.sort(list);
            answer[n++]=list[commands[i][2]-1];
        }
        return answer;
    }
}