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

---

def solution(array, commands):
	answer = []
    
    for m in range(len(commands)):
    	i = commands[m][0]
        j = commands[m][1]
        k = commands[m][2]
        
        new_arr = array[i-1:j]
        new_arr.sort()
        
        answer.append(new_arr[k-1])
        
    return answer