POJ 3253 Fence Repair
来源:互联网 发布:ar看车源码 编辑:程序博客网 时间:2024/06/05 07:21
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).
题目大意:有一个农夫要把一个木板钜成几块给定长度的小木板,每次锯都要收取一定费用,这个费用就是当前锯的这个木版的长度,给定各个要求的小木板的长度,及小木板的个数n,求最小费用
优先队列水题,每次算最小的即可,要用long long
#include<iostream>#include<queue>using namespace std;typedef long long ll;int main(){ios::sync_with_stdio(0);int n;cin>>n;priority_queue<int,vector<int>,greater<int> >que;while(n--){int x;cin>>x;que.push(x);}ll ans=0;while(!que.empty()){int a=que.top();ans+=a;que.pop();if(que.empty()) break;int b=que.top();ans+=b;que.pop();if(que.empty()) break;que.push(a+b);}cout<<ans<<endl;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
- vijos 小胖守皇宫
- Reactor模型 三种模型 演变
- 简单的实现环形比例图
- 逃离迷宫(BFS)
- Oracle中CASE WHEN的用法实例
- POJ 3253 Fence Repair
- springboot+springdatajpa 数据库命名
- Static Proxy(静态代理)
- Android中post请求AsyncTask延时
- [NLP]使用LDA模型计算文档相似度
- PHP中->和=>的意思
- C++之在资源管理类中小心copying行为(14)---《Effective C++》
- PCL1.8+vs2013环境搭建
- net.sf.json.JSONException