https://school.programmers.co.kr/learn/courses/30/lessons/138477
def solution(k, score):
answer = []
hof = []
for i in score:
hof.append(i)
hof.sort(reverse=True)
if len(hof) > k:
hof.pop()
answer.append(hof[-1])
return answer