[Python] 야근 지수

[Python] 야근 지수

풀이

1. n이 works 전체 합보다 크면 0

2. python heapq(java의 priority queue) 사용

3. 최대 힙을 만들기 위해 -1로 works 치환

import heapq def solution(n, works): if n >= sum(works): return 0 works = [-i for i in works] heapq.heapify(works) for _ in range(n): w = heapq.heappop(works) + 1 heapq.heappush(works, w) return sum([i**2 for i in works])

from http://yoseph0310.tistory.com/104 by ccl(A) rewrite - 2021-09-07 21:27:20