프로그래머스 야근 지수

https://school.programmers.co.kr/learn/courses/30/lessons/12927

프로그래머스

 

import heapq
def solution(n, works):
    ans = 0
    if sum(works) <= n:
        return ans

    pq = []
    for work in works:
        heapq.heappush(pq,(-work,work))

    while n > 0:
        negative, positive = heapq.heappop(pq)
        if positive > 0:
            negative += 1
            positive -= 1
            n -= 1
            heapq.heappush(pq,(negative,positive))
        else:
            heapq.heappush(pq,(negative,positive))

    for _, elem in pq:
        ans += elem ** 2
    return ans