Fence Repair POJ - 3253

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

AC代码： 

//Fence Repair POJ - 3253 --贪心 
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;
const int MAX = 50000;
int N;//木板个数 
int L[MAX+10];

void solve(){
	ll ans = 0;
	while(N>1){//直到计算到木板为1块时为止 
		int mii1 = 0, mii2 = 1;//求出最短的板mii1 和次短的板mii2
		if(L[mii1] > L[mii2]){
			swap(mii1,mii2);//保证mii1是最短的 
		}
		
		for(int i=2; i<N; i++){
			if(L[i] < L[mii1]){
				mii2 = mii1;
				mii1 = i; //保证mii1是最短的,mii2是次短的 
			}else if(L[i] < L[mii2]){
				mii2 = i;
			}
		}
		
		//将两块板拼合
		int t = L[mii1] + L[mii2];
		ans += t;
		
		if(mii1 == N-1){
			swap(mii1,mii2);
		} 
		L[mii1] = t;
		L[mii2] = L[N-1];
		N--;
	}
	
	printf("%lld\n",ans);
}

int main(void)
{
	cin >> N;
	for(int i=0; i<N; i++){
		cin >> L[i];
	}
	
	solve();
	
	return 0;
}

 

代码二：

#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long ll;
priority_queue<int,vector<int>,greater<int> > q;//优先队列，元素从小到大排列 

int main(void)
{
	int n;
	cin >> n;
	for(int i=0; i<n; i++){
		int value;
		cin >> value;
		q.push(value);
	}
	
	ll ans = 0;
	while(q.size() > 1){
		int min1 = q.top();
		q.pop();
		int min2 = q.top();
		q.pop();
		ans += (min1 + min2);
		q.push(min1+min2);//不是push（ans） 
	}
	
	cout << ans << endl; 
	return 0;
}