POJ 3253 Fence Repair C++ STL multiset 可解

Fence Repair
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 53106 Accepted: 17508
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

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).

思路：在集合中每次找最短的两个加起来，算到ans里。
　　　再将这两个数从集合中删除，把他们的和加入到集合里。

　　用multiset解的话，插入和查找都是O(log(n))，再加上遍历一遍，总复杂度是:O(nlog(n))。

代码：

#include <iostream>
#include <set>
using namespace std;
typedef long long ll;multiset <int> s;int main() {int n,key;cin >> n;for(int i = 0;i < n; i++) cin >> key,s.insert(key);ll ans = 0;while(s.size() > 1){int k1 = *s.begin();s.erase(s.begin());int k2 = *s.begin();s.erase(s.begin());int t = k1+k2;ans += t;s.insert(t);}cout << ans << endl;return 0;
}
//  writen by zhangjiuding

POJ 3253 Fence Repair C++ STL multiset 可解相关推荐

POJ 3253 Fence Repair（修篱笆）
POJ 3253 Fence Repair(修篱笆) Time Limit: 2000MS Memory Limit: 65536K [Description] [题目描述] Farmer Joh ...
POJ 3253 -- Fence Repair
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 55661 Accepted: 18331 De ...
贪心算法-----poj 3253 Fence Repair（切木板）
Description Farmer John wants to repair a small length of the fence around the pasture. He measures ...
POJ 3253 Fence Repair 贪心
每次合并选最短的两块木板,用优先队列优化. //#pragma comment(linker, "/STACK:1024000000,1024000000") #include&l ...
POJ No. 3253 Fence Repair
POJ No. 3253 Fence Repair 官方地址题目农夫约翰为了修理栅栏,要将一块很长的木板切割成N块.准备切成的木板的长度为L1.L2.-.LN,未切割前木板的长度恰好为切割后木板长 ...
POJ 3253 - Fence Repai ( 优先队列 )
题意切割木板, 比如一根长21的木板要切割成5, 8, 8的三块, 每次切割花费的金额为两断的长度. 比如先把21切成16和5, 花费21元, 再把16切成8和8, 花费16元, 总计消费37元. ...
Fence Repair （二叉树求解）（优先队列，先取出小的）
题目链接:http://poj.org/problem?id=3253 Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Sub ...
贪心：Fence Repair、Saruman's Army
Fence Repair Farmer John wants to repair a small length of the fence around the pasture. He measures ...
[BZOJ1724][Usaco2006 Nov]Fence Repair 切割木板
1724: [Usaco2006 Nov]Fence Repair 切割木板 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 1272 Solved: ...

POJ 3253 Fence Repair C++ STL multiset 可解

POJ 3253 Fence Repair C++ STL multiset 可解相关推荐

最新文章

热门文章