问题
源码
/*
* problem: Fence Repair
* method: 贪心、哈夫曼树
* date: 2020/05/05
*/
#include<iostream>
using namespace std;
const int N=10;
int n=3;//需分成n块
int L[N]={8,5,8};//各段长度
void swap(int& a,int& b){
int t=a;
a=b;
b=t;
}
int solve(){
int ans=0;
while(n>1){
int mii1=0,mii2=1;
if(L[mii1]>L[mii2]) swap(mii1,mii2);
for(int i=2;i<n;i++){
if(L[i]<L[mii1]){
mii2=mii1;
mii1=i;
}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--;
}
return ans;
}
int main(){
cout<<solve();
return 0;
}