SDUTOJ 2848 Fence Repair
来源:互联网 发布:软件加人规则 编辑:程序博客网 时间:2024/06/05 20:10
SDUTOJ 2848 Fence Repair
题目链接:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2848
题目大意:有n块木头,长度分别给出,要把这些木头修成栅栏,每次挑出两块连成一截,并花费这两块木头长度的钱。最终要把所有木块合成一条栅栏,问最少花费多少钱。
题目分析:哈夫曼树经典例题。
code:
#include<cstdio>#include<queue>using namespace std;struct cmp{ bool operator ()(int &a,int &b) { return a>b;//最小值优先 }};int main(){ int i,m,n,t; long long count; while(scanf("%d",&n)!=EOF) { priority_queue<int,vector<int>,cmp>q; for(count=i=0;i<n;i++) { scanf("%d",&m); q.push(m); } while(!q.empty()) { m=q.top(); q.pop(); if(q.empty())break; m+=q.top(); q.pop(); q.push(m); count+=m; } printf("%lld\n",count); } return 0;}
PS:O了
0 0
- SDUTOJ 2848 Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- ListView与 simpleadapter 。baseadapter
- windows 域控制器
- 一位数据挖掘成功人士给数据挖掘在读研究生的建议
- serializable 序列化
- 使用librtmp进行H264与AAC直播
- SDUTOJ 2848 Fence Repair
- Pat(Advanced Level)Practice--1060(Are They Equal)
- 空间滤波(二)
- reds 2 之 hiredis
- 定积分解法
- hdu 2066 一个人的旅行_最短路
- 微软面试100题之第4题
- event.preventDefault() 取消事件的默认行为
- uva 11967 - Hic-Hac-Hoe