---
tags: Algorithm
---
# POJ 3617 Priority Queue Python solution

from queue import PriorityQueue

pq = PriorityQueue()

n = int(input())
L = []
for i in range(n):
    L.append(int(input()))
ans = 0
for i in range(n):
    pq.put(L[i])
while n>1:
    m1 = pq.get()
    m2 = pq.get()
    ans += m1+m2
    pq.put(m1+m2)
    n -= 1
print(ans)