정렬알고리즘 - Lv1(K번째수)-1(completed)

import java.util.Arrays;
class Solution {
    public int[] solution(int[] array, int[][] commands) {
        int[] answer = {};
        int cmdCount = commands.length;
        answer = new int[cmdCount];
        for(int i=0; i<cmdCount; i++){
            int[] arr = Arrays.copyOfRange(array, commands[i][0]-1, commands[i][1]);
            Arrays.sort(arr);
            answer[i]  = arr[commands[i][2]-1];
        }
        return answer;
    }
}

무난무난 하다!... 사실 정렬알고리즘 자체를 구현하지 않아서......