poj 3253 Fence Repair greater<int>
2017-08-01 21:04
501 查看
Fence Repair
PKU. : 3253
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
Line 1: One integer N, the number of planks
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input
3
8
5
8
Sample Output
34
Hint
He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
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).
自己画一下画出来的东西就像一个二叉树,连个小的子节点组成一个大的父节点,维护一个队列每次加最小的两个
PKU. : 3253
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
Line 1: One integer N, the number of planks
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts
Sample Input
3
8
5
8
Sample Output
34
Hint
He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
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).
自己画一下画出来的东西就像一个二叉树,连个小的子节点组成一个大的父节点,维护一个队列每次加最小的两个
#include<iostream> #include<cstring> #include<cstdio> #include<string> #include<cmath> #include<map> #include<functional> #include<queue> #include<vector> typedef long long ll ; const ll mod=1e9+7; using namespace std; int main() { int n,a,i,j; while(cin>>n) { priority_queue<int ,vector<int>,greater<int> > q; while(!q.empty()) { q.pop(); } while(n--) { scanf("%d",&a); q.push(a); } ll ans=0; while(q.size()!=1) { int min1=q.top(); q.pop(); int min2=q.top(); q.pop(); int t=min1+min2; ans+=t; q.push(t); } printf("%lld\n",ans); } return 0; }
相关文章推荐
- 【原创】【合并类贪心】POJ 3253 1862 2709; Fence Repair && Stripies && Painter
- greater<int>()
- Fence Repair POJ - 3253
- POJ 3253 Fence Repair STL 优先队列
- poj1037 A decorative fence<DP>
- priority_queue<int,vector<int>,greater<int>>优先队列 按照由小到大顺序
- greater<int>()表示内置类型从大到小排序,less<int>()表示内置类型从小到大排序
- priority_queue<int,vector<int>,greater<int>>优先队列 按照由小到大顺序
- POJ 3253 Fence Repair (priority_queue的用法) ----- less<int> 和 greater<int>
- Fence Repair POJ 3253
- priority_queue<int,vector<int>,greater<int>>优先队列,按照从小到大
- 刷题——Fence Repair POJ - 3253
- greater<int>()和less<int>()的使用
- Fence Repair POJ - 3253
- POJ 3253 Fence Repair G++
- Fence Repair POJ - 3253 最小优先队列,哈弗曼树
- set<int,greater<int>>
- POJ 3253 Fence Repair Huffman
- priority_queue<int,vector<int>,greater<int>>优先队列 按照由小到大顺序
- multiset<int, greater<int>> test 相关