[백준][Python] 1715번 카드 정렬하기

import heapq

n = int(input())
card = []
for _ in range(n):
    card.append(int(input()))
heapq.heapify(card)
result = 0
while len(card) != 1:
    num1 = heapq.heappop(card)
    num2 = heapq.heappop(card)
    cumsum = num1 + num2
    result += cumsum
    heapq.heappush(card,cumsum)
print(result)