# POJ 3253 Fence Repair(贪心—霍夫曼树or优先队列)

Fence Repair
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 34063 Accepted: 10969

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

（a1+a2）,a3,a4.....an

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[20020];

int main()
{
int n,i;
long long ans;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;++i)
scanf("%d",&a[i]);
ans=0;
while(n>1)
{
int one=0,tow=1;//one标记最小的，tow标记次最小的
int t;
if(a[one]>a[tow])
{
t=one;
one=tow;
tow=t;
}
for(i=2;i<n;++i)
{
if(a[i]<a[one])
{
tow=one;
one=i;
}
else if(a[i]<a[tow])
tow=i;
}
a[one]+=a[tow];
ans+=a[one];
a[tow]=a[n-1];
n--;
}
printf("%lld\n",ans);
}
return 0;
} 

#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int main()
{
int n,a,one,tow,i;
long long ans;
while(scanf("%d",&n)!=EOF)
{
priority_queue<int,vector<int>,greater<int> >q;
ans=0;
for(i=0;i<n;++i)
{
scanf("%d",&a);
q.push(a);
}
while(q.size()>1)
{
one=q.top();
q.pop();
tow=q.top();
q.pop();
ans+=(one+tow);
q.push(one+tow);
}
printf("%lld\n",ans);
}
return 0;
} 

﻿﻿

• 本文已收录于以下专栏：

## 利用优先队列编写哈夫曼树和编码

• S2637281620
• 2016年11月17日 19:16
• 567

## 哈夫曼树--九度 1172 & 1107 [优先队列实现小顶堆]

• qq_26398495
• 2017年02月25日 09:38
• 343

## 优先队列解哈夫曼编码问题之带权路径长度

1.什么是优先队列？ 先说个生活中的例子 想想医院，重症急诊患者肯定不能像普通患者那样依次排队就诊，他们就可以插队了 他比较迟进队列，但他优先级高，所以就相对较早出队列去就诊了 优先队列一般用...
• u012763794
• 2016年03月30日 23:39
• 1276

## c++使用优先队列来构建huffman树[哈夫曼树]

#include #include #include #include #include using namespace std; char Table[26]; struct Node...
• realxie
• 2011年12月18日 17:28
• 2423

## hdu 1053 哈夫曼树 优先队列

• Techmonster
• 2015年11月17日 16:26
• 668

## 使用优先队列构建赫夫曼树

• RowandJJ
• 2014年06月18日 12:20
• 1781

## POJ3253 Fence Repair 贪心法 哈夫曼树

• qq_26071477
• 2016年06月14日 16:57
• 498

## POJ 3253 Fence Repair 霍夫曼树 贪心 优先队列

• u013287817
• 2014年07月18日 16:15
• 355

## hdu 5884- Sort 哈夫曼树构造 + 模拟优先队列 + 二分

http://acm.hdu.edu.cn/showproblem.php?pid=5884 题意：模拟归并的过程，每次可以归并k个.要求最后总花费不超过T 这个花费就是哈夫曼树的花费... ...
• viphong
• 2016年09月17日 19:25
• 326

## 树-堆结构练习——合并果子之哈夫曼树 （STL 优先队列）

• ZHC_AC
• 2015年08月10日 10:48
• 512

举报原因： 您举报文章：POJ 3253 Fence Repair(贪心—霍夫曼树or优先队列) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)