Particle Accelerator II

import heapq

def minimum_combination_cost(n, masses):
    heapq.heapify(masses)
    total_cost = 0

    while len(masses) > 1:
        x = heapq.heappop(masses)
        y = heapq.heappop(masses)
        cost = x * y
        total_cost += cost
        heapq.heappush(masses, x + y)

    return total_cost

 
n = int(input())
masses = list(map(int, input().split()))

 
print(minimum_combination_cost(n, masses))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED