LV1. K번째 수

class Solution {
    public int[] solution(int[] array, int[][] commands) {
        int[] answer = new int[commands.length];

        int[] tempArr;
        for(int i=0; i<commands.length; i++) {
    		int start = commands[i][0]-1;
    		int end = commands[i][1]-1;
    		int target = commands[i][2]-1;
        	
        	tempArr = new int[end - start + 1];
        	for(int k=0; k<tempArr.length; k++) {
        		tempArr[k] = array[k + start];
        	}
        	
        	Arrays.sort(tempArr);
        	answer[i] = tempArr[target];
        }
        
        return answer;
    }
}