UVA 10954 Add All(优先队列)
来源:互联网 发布:007网盘搜索引擎源码 编辑:程序博客网 时间:2024/04/29 08:07
Add All
Input: standard input
Output: standard output
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 = 6, cost = 6
Total = 10
2 + 3 = 5, cost = 5
1 + 5 = 6, cost = 6
Total = 11
I hope you have understood already your mission, to add a set of integers so that the cost is minimal.
Input
Each test case will start with a positive number, N (2 ≤ N ≤ 5000) followed by N positive integers (all are less than 100000). Input is terminated by a case where the value of N is zero. This case should not be processed.
Output
For each case print the minimum total cost of addition in a single line.
Sample Input Output for Sample Input
3
1 2 3
4
1 2 3 4
0
9
19
输入的整数按从小到大的顺序,依次相加,在把它们的和放到优先队列里,把中途产生的所有和加起来即为最后结果
#include <iostream>#include <cstdio>#include <cstring>#include <stdlib.h>#include <cmath>#include <queue>#define eps 1e-8#define N 1000010using namespace std;int main(){ int n; while(scanf("%d",&n),n) { priority_queue<int, vector<int>, greater<int> > q; int x; for(int i=0;i<n;i++) { scanf("%d",&x); q.push(x); } int ans=0; while(!q.empty()) { int x1=q.top(); q.pop(); int x2=q.top(); q.pop(); ans+=x1+x2; if(!q.empty()) q.push(x1+x2); } printf("%d\n",ans); } return 0;}
- UVa 10954 Add All ( 优先队列 )
- UVa 10954 - Add All 贪心+优先队列
- UVA - 10954 Add All 优先队列
- UVa 10954 Add All(优先队列)
- UVA 10954 Add All(优先队列)
- UVA 10954- Add All(优先队列)
- Add All - UVa 10954 优先队列
- UVA 10954 Add All【优先队列简单应用】
- UVA 10954 Add All (贪心 + 优先队列)
- uva - 10954 - Add All(优先队列、哈夫曼编码思想)
- UVA - 10954 Add All(贪心+优先队列)
- UVa 10954 Add All (石子合并_优先队列)
- UVa 10954 Add All ——优先队列
- Add All -uva优先队列的应用
- UVA Add All(优先队列)
- UVA 10954 Add All 全加一起 模拟+贪心+优先队列
- UVA10954 Add All (优先队列)
- [贪心&&优先队列]uva10954 Add All
- HDU 5106 Bits Problem (数位DP)
- IOS alpha导致subview也透明了(opacity)
- 阿拉伯数字转人民币大写测试版
- servlet通过web.xml配置在服务器启动时自动启动
- python第三方库系列之十四--集群化部署定时任务apscheduler库
- UVA 10954 Add All(优先队列)
- 计算机之快捷键
- c++_primer_exercise_1511_1512_1513_1514
- BZOJ 1030: [JSOI2007]文本生成器
- 【GDOI2004】破坏行动 PASCAL
- 最大流PASCAL
- 【网络流24题】太空飞行计划问题 …
- 【NOIP2003提高组】加分二叉树
- 2012年东莞市GDOI市选题第二题--…