题解 | #分金条的最小花费#
分金条的最小花费
http://www.nowcoder.com/practice/418d2fcdf7f24d6f8f4202e23951c0da
n = int(input())
nums = list(map(int, input().split()))
import heapq
heapq.heapify(nums)
res = 0
while len(nums) > 1:
a, b = heapq.heappop(nums), heapq.heappop(nums)
res += a + b
heapq.heappush(nums, a + b)
print(res)
查看18道真题和解析