Huffuman树

题目：

思路：
直接暴力遍历就完了

n = int(input())
nums = [int(i) for i in input().split()]
cost = 0
while len(nums) > 1:
    a = min(nums)
    nums.remove(a)
    b = min(nums)
    nums.remove(b)
    c = a+b
    nums.append(c)
    cost += c
    # print(nums)
print(cost)