[프로그래머스] K번째수

링크: 프로그래머스 - 정렬 > K번째수

풀이1 (py)

def solution(array, commands):
    answer = []
    sliced = []
    
    for i, j, k in commands:
        sliced.sorted(array[i-1:j])
        answer.append(sliced[k-1])
        
    return answer

풀이2 (js)

function solution(array, commands) {
    var answer = [];
    for (let [i, j, k] of commands){
        answer.push(array.slice(i-1, j).sort((a, b) => a - b)[k-1])        
    }
    return answer;
}