题目:
Fence Repair
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice POJ 3253
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).
题目大意:
给n个数,每两个数合成需要耗费两个数a+b的费用,形成c(a+b),求合成一个的最小费用
题目思路:
1、因为当三个数合并时 有三种:(a+b)+c (b+c)+a ()a+c)+b
费用 (a+b)*2+c (b+c)*2+a ()a+c)*2+b
2、所以我们尽量使括号内的小,所以我们去最小的两个数先运算.直到队列里只有一个
3、 所以要用优先队列
程序:
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cctype>
#include <fstream>
#include <limits>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cassert>
using namespace std;
int main()
{
int n;
priority_queue<long long int,vector<long long int> , greater<long long int> >qu;
while(~scanf("%d",&n))
{
while(!qu.empty())
qu.pop();
long long int ans=0;
for(int i=0;i<n;i++)
{
int t;
scanf("%d",&t);
qu.push(t);//放进队列
}
while(!qu.empty())
{
long long int a,b;
a=qu.top();
qu.pop();
if(qu.empty())break;
b=qu.top();
qu.pop();
ans+=a+b;
qu.push(a+b);//放入之和
}
cout<<ans<<endl;;
}
return 0;
}