Fence Repair POJ 3253
来源:互联网 发布:工业数据采集 求 编辑:程序博客网 时间:2024/05/19 20:37
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN (1 ≤ N ≤ 20,000) planks of wood, each having some integer lengthLi (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into theN planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.
FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.
Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of theN-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.
Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create theN planks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.
Input
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Sample Input
3858
Sample Output
34
Hint
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into 16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).
运用优先队列+long long,数据最大肯定比20000*50000大,WA了一次才知道。
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<queue>using namespace std;int main(){ priority_queue <int,vector<int>,greater<int> >q; int n; int a[20010]; cin>>n; for(int i=0; i<n; i++) { cin>>a[i]; q.push(a[i]); } int x,y,ans; long long sum=0; while(!q.empty()) { x=q.top(); q.pop(); if(q.empty()==true) { break; } y=q.top(); q.pop(); ans=x+y; sum+=ans; q.push(ans); } printf("%lld\n",sum); return 0;}
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- POJ 3253Fence Repair
- POJ--3253 -- Fence Repair
- poj-3253-Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- poj 3253 Fence Repair
- POJ - 3253 Fence Repair
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- poj 3253---Fence Repair
- SAP财务管控(财务总监背后的管理大师)
- Java中的反射机制
- GitHub contributions 统计规则
- MYSQL用户创建删除和权限问题
- 字符串逆序
- Fence Repair POJ 3253
- python学习--核心编程4习题以及知识点记录
- MyEclipse 控制台等显示在底部
- HTML5仿Apple Watch时钟动画
- Intel DPDK 简要介绍
- Django登陆以后重定向到请求登陆的页面
- 使用Core Graphics绘画一个山寨微信icon
- Erlang高级数据类型,函数式、列表解析、二进制、引用
- ZOJ 3209 Treasure Map (DLX精确覆盖)