Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 40747 | Accepted: 13321 |
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
3 8 5 8
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).
题目大意:
给你n个小的木棍,让你将其拼接为一根木棍,每次拼接使用的花费为:(比如木棍a长度为aa,木棍b长度为bb)aa+bb,问将这些个木棍组合起来需要的最小花费。
思路:
1、挑战程序竞赛第二版上的贪心经典题。(水水更健康- -越水越菜)
2、根据题目中规则,每次我们都选择木棍中最短的两根将其拼接起来,就能够得到最小花费,那么我们需要维护这个最小花费,我们直接开一个优先队列即可。注意数据比较大,需要使用long long数据类型
Ac代码:
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define ll __int64
ll a[350000];
int main()
{
int n;
while(~scanf("%d",&n))
{
priority_queue<int,vector<int>,greater<int> >s;//注意“>>”会被认为错误,
for(int i=1;i<=n;i++)
{
scanf("%I64d",&a[i]);
s.push(a[i]);
}
ll sum=0;
while(s.size()>1)
{
ll a=s.top();
s.pop();
ll b=s.top();
s.pop();
ll c=a+b;
s.push(c);
sum+=a+b;
}
printf("%I64d\n",sum);
}
}