蓝桥杯基础练习VIP-Huffuman树

解题思路:

注意事项:

参考代码:

n = int(input())

L = list(map(int,input().split()))

L2 = []

while len(L)>1:

    L1 = sorted(L)

    a = sum(L1[:2])

    L1 = L1[2:]

    L1.append(a)

    L2.append(a)

    L = list(L1.copy())

print(sum(L2))