POJ3253——Fence Repair
来源:互联网 发布:不化妆的人 知乎 编辑:程序博客网 时间:2024/05/26 12:55
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N 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 the N-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 the N 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).
Source
优先队列。。。STL模板。。。
升序排序,每次取前两个最小的,加和,总花费再加上前两个数的和,和再进队;
#include <iostream>#include <queue>#include <vector>#include <cstdlib>#include <cstdio>using namespace std;struct cmp{ bool operator () (int &a, int &b) //自定义比较函数,升序 { return a>b; }};int main(){ long long sum = 0; //总花费 int n; cin>>n; priority_queue<int, vector<int>,cmp> q; for( int i = 1;i <= n;i++ ) { int x; cin>>x; q.push(x); } while(q.size()>1) { long long x, y; x = q.top(); q.pop(); y = q.top(); q.pop(); sum += x+y; q.push(x+y); } cout<<sum<<endl; return 0;}
- Poj3253—Fence Repair
- poj3253——Fence Repair
- POJ3253——Fence Repair
- POJ3253——Fence Repair
- poj3253——Fence Repair
- poj3253——Fence Repair(哈夫曼)
- poj3253 Fence Repair —huffman&&贪心(离散数学233)
- POJ3253 Fence Repair
- poj3253 Fence Repair( 贪心 )
- poj3253 Fence Repair
- poj3253 Fence Repair
- poj3253 Fence Repair---赫夫曼树
- poj3253 Fence Repair
- POJ3253 Fence Repair
- POJ3253 Fence Repair
- POJ3253--Fence Repair
- POJ3253 Fence Repair(贪心)
- POJ3253 Fence Repair
- 获取urllib2.urlopen失败时的错误页面
- hdu 1520 Anniversary party
- tjut 5443
- Python正则表达式
- 【51Nod】1174 - 区间中最大的数(RMQ)
- POJ3253——Fence Repair
- GOF之中介者模式
- C#中virtual和abstract的区别
- 函数可变参数
- 模拟用户注册,小案例
- Novate 网络库:Retrofit2.0和RxJava的又一次完美改进加强(Tamic博客 -CSDN)
- Qt:no matching function for call to (类名)::connect()的错误原因总结
- ubuntu12.04安装vsftpd
- Android单例模式