uva 10954 Add All(排序)

该博客介绍了UVA 10954问题,任务是计算一组数字的总和,但每次加法操作都有成本,即两数之和。目标是以最低的总成本进行加法。输入包含一系列正整数(数量不超过5000,每个数小于100000),输入以N=0结束。输出要求显示每组数据的最低总成本。
摘要由CSDN通过智能技术生成

                            uva 10954 Add All



Yup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++ program just to add a set of numbers. Such a problem will simply question your erudition. So, let’s add some flavor of ingenuity to it.

 

Addition operation requires cost now, and the cost is the summation of those two to be added. So, to add 1 and 10, you need a cost of 11. If you want to add 1, 2 and 3. There are several ways –

 

1 + 2 = 3, cost = 3        

3 + 3 = 6, cost = 6

Total = 9

1 + 3 = 4, cost = 4              

2 + 4 =

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值