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

import sys,heapq
input = sys.stdin.readline

n = int(input())
heap = []
for _ in range(n):
    num = int(input())
    heapq.heappush(heap,num)

if len(heap)==1:
    print(0)
else:
    result = 0
    while len(heap)>1:
        min1 = heapq.heappop(heap)
        min2 = heapq.heappop(heap)
        result += min1 + min2
        heapq.heappush(heap,min1+min2)

    print(result)