#原题:
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,因为每次切不一定能切出一个需要的木板,所以先把数组从小到大排列,把最短的两项相加,并加到总金钱之中,然后把这个和值重新排列到数组中,而原本的两块木板移除,当木板总数<=1时就能得到最小的佣金。
代码如下:
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[99000];
int main()
{
int i,j,w,n;
long long sum=0,he;
while(~scanf("%d",&n))
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
sum=0;
for(i=0;i<n-1;i++)
{
he=a[i]+a[i+1];
sum+=he;
for(j=i+2;j<n;j++)
{
if(he>a[j])
a[j-1]=a[j];
else
{
a[j-1]=he;
break;
}
}
if(j==n)
a[j-1]=he;
}
printf("%lld\n",sum);
}
return 0;
}