POJ 3253 fence repair [STL][priority_queue]
来源:互联网 发布:回收站清空数据恢复 编辑:程序博客网 时间:2024/06/05 07:04
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
3858
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 <vector>#include <algorithm>#include <queue>#include <cstdio>using namespace std;//int main() {// vector <int> planks;// int n;// cin >> n;// while(n--){// int m;// cin >> m;// planks.push_back(m);// }// sort(planks.begin(), planks.end());// vector<int> :: iterator it;// int sum=0,temp=0;// // for(it = planks.begin(); it != planks.end(); it++){// temp += *it;// if(it != planks.begin()) sum +=temp;//// cout << "temp:" << temp << endl;//// cout << "sum:" <<sum << endl;// }// cout << sum <<endl;// // return 0;//}// 这种想法实际上是错误的 应该总是粘连两条长度最小的木条!!!int main(){ typedef long long LL; typedef priority_queue<LL,vector<LL>,greater<LL>> Pqueue; Pqueue planks; int n,t; cin >> n; t=n; while (n--) { int m; cin >> m; planks.push(m); } t--; LL sum=0; while (t--) { LL temp=0; temp += planks.top(); planks.pop(); temp += planks.top(); planks.pop();// cout << "temp:" << temp << endl; sum += temp; planks.push(temp); } cout << sum <<endl; return 0;}
0 0
- POJ 3253 fence repair [STL][priority_queue]
- poj 3253 Fence Repair(Huffman问题,优先队列priority_queue)
- 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
- 贪心—最少拦截系统
- Android微信智能心跳方案(转)
- 创建对象之构造函数模式
- 04-android生命周期
- 清北学堂游记(2)
- POJ 3253 fence repair [STL][priority_queue]
- PAT(甲级)1077. Kuchiguse (20)
- 《iOS移动开发从入门到精通》图书连载20:枚举
- Gif截图工具——GifCam
- 机器学习实战之决策树
- android 使用RxJava实现预加载
- 《Spark商业案例与性能调优实战100课》第14课:商业案例之纯粹通过DataSet进行电商交互式分析系统中特定时段购买金额Top10 和访问次数增长Top10
- 【Hibernate】——缓存
- 【排序】时间复杂度为O(N^2)的排序——冒泡、选择和插入排序