[Codetree] 큰 숫자만 계속 고르기 Python

https://www.codetree.ai/missions/8/problems/keep-picking-the-big-number/description

코드트리 | 코딩테스트 준비를 위한 알고리즘 정석

 

import sys
from heapq import heappush, heappop, heapify


input = sys.stdin.readline


n, m = map(int, input().split())
num = list(map(int, input().rstrip().split()))
num = [-x for x in num]

heapify(num)

for _ in range(m):
    max_val = -heappop(num)
    heappush(num, -(max_val-1))

print(-num[0])