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

Inputcopy	Outputcopy
3 8 5 8	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 块。准备切成的木板长度为L1，L2…LN, 未切割前木板的长度恰好未切割后木板长度的总和。 每次切断木板时 ，需要的开销为这块木板的长度。 例如长度为 21 的木板要切成长度为 5 ，8 ，8 的三块木板。长 21 的木板切成长为 13 和 8 的板时，开销为 21 . 再将长度 为 13 的板切成长度为 5 和 8 的板 时，开销是 13，于是开销就是 34，请求出按照木板要求将木板切割完最小的开销是多少。

输入

• 第一行是整数 n(1≤n≤20000)，表示要将原始木板切割成多少块
• 接下来 nn 行，每行一个整数，表示最终每块小木板的长度，其中1≤Li​≤50000

输出

• 一行，一个整数，表示达到目标所需的最小代价样例 1

输入

3
8
5
8

输出

34

分析：

1.排序，从小的开始加，5+8=13，再次13+8=21，则21+13=34；

2.使用到了优先队列，从已知数据中从小开始叠加ans；

#include <stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
using namespace std; 
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
	int n;
	while(cin>>n){
	int x;
	for(int i=0;i<n;i++){
		cin>>x;
		q.push(x);
	}
	long long ans=0;
	while(q.size()>1){
		int a=q.top();
		q.pop();
		int b=q.top();
		q.pop();
		ans+=a+b;
		q.push(a+b);
		}
		cout<<ans<<endl;
	}
}