✨ 공부 기록/알고리즘
[프로그래머스 lv 1] K번째수 (정렬)
LaonMoon
2025. 3. 3. 19:05
def solution(array, commands):
answer = []
for command in commands:
new_array = array[command[0]-1:command[1]]
new_array.sort()
answer.append(new_array[command[2]-1])
return answer