Fence Repair
来源:互联网 发布:兼职seo软文代写 编辑:程序博客网 时间:2024/05/19 09:12
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).
#include <set>#include <algorithm>#include <iostream>using namespace std;int main(){multiset<int> s;long long ans = 0; //用于保存结果 int n;cin >> n;for(int i = 0; i < n; i++) {//把各个短木板放入容器中,利用set容器的自动排序功能 int temp;cin >> temp;s.insert(temp);}multiset<int>::iterator it;it = s.begin();while(!s.empty()) { //每次计算出两个最小元素的和赋值给临时变量temp,//然后删除这两个最小元素,并把他们的和temp放进容器, int temp = 0;temp = temp + *it;s.erase(it);it = s.begin();temp = temp + *it;s.erase(it);it = s.begin();s.insert(temp);ans =ans + temp; //ans加上每一次的临时变量temp if(s.size() == 2) { //当容器中只剩下两个元素的时候,用ans与最后两个元素相加即为最终结果 ans = ans + *it;s.erase(it);it = s.begin();ans = ans + *it;break;}}cout << ans << endl;return 0;}
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Fence Repair
- Codeforces 371D Vessels【思维+并查集】经典套路题
- drop truncate delete的区别
- 八大排序算法(Java实现)
- Spyder中import tensorflow出现问题
- handler+WeakReference简单优化Activity
- Fence Repair
- ActiveMQ笔记(2):基于ZooKeeper的HA方案
- tomcat 三种静态部署方式
- split函数解析
- c++取模运算/求余运算
- vb.net 教程 4-3 文件操作 FileInfo 2
- IntelliJ IDEA 安装插件 (vue)
- 垃圾回收参数
- “盛大游戏杯”—K 购买装备