from heapq import heapify, heappop, heappush

def solution(n, works):
    if n>=sum(works):
        return 0

    heap = []
    for i in works:
        heappush(heap,i*-1)

    for i in range(n):
        front = heappop(heap)*-1
        front -=1
        heappush(heap,front*-1)
        
    answer = 0
    for i in heap:
        answer+=i**2
    return answer