#include<iostream>
#include<stack>
#include <limits.h>
#include<iomanip>
using namespace std;
struct element{
int weight;
int lchild,rchild,parent;
};
void select(element huffTree[],int n, int &s1,int &s2){
s1 = s2 = 0;
int min1 = INT_MAX; //min1为最小值,INI_MAX数值为2^31-1
int min2 = INT_MAX; //min2为次小值
//找最小值就默认为最大值
for(int i=0;i<n;i++){
if(huffTree[i].parent ==