【合并果子】的两种方法

哈夫曼树+堆

#include<iostream>
#include<cstdio>
const int maxn=10000+10;
using namespace std;
int a[maxn];
int main(){
	int i,j,k,m,n,ans=0;
	cin>>n;
	for(i=1;i<=n;i++){
		scanf("%d",&a[i]);
		k=i;
		while(k>1 && a[k]<a[k/2]){
			int t=a[k];a[k]=a[k/2];a[k/2]=t;
			k/=2;
		}
	}
	int len=n;
	while(len>1){
		int sum=a[1];
		a[1]=a[len--];
		k=1;
		while((k*2<=len && a[k]>a[k*2])||(k*2+1<=len && a[k]>a[k*2+1])){
			m=k*2;
			if(m+1<=len && a[m]>a[m+1])m++;
			int t=a[k];a[k]=a[m];a[m]=t;
			k=m;
		}
		sum+=a[1];
		a[1]=a[len--];
		k=1;
		while((k*2<=len && a[k]>a[k*2])||(k*2+1<=len && a[k]>a[k*2+1])){
			m=k*2;
			if(m+1<=len && a[m]>a[m+1])m