赫夫曼树构造及其带权长度计算

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
#pragma warning (disable:4996)
#define OFF 0//权值未被使用
#define ON  1//权值已被使用
typedef struct HTNode {
   
	unsigned int weight;//为ss数组初始化方便，规定权值只能是非负数
	int boom;//用来标记该权值是否被使用过
	int tag;//数组下标
	int parent, lchild, rchild;
	int count;//用来记录权值结点及其双亲参与到计算的次数
}HTNode;
void select(HTNode* huffTree, int k, int& i1, int& i2)
{
   
	int i = 0, j, n;
	int* ss = new int[k];
	memset(ss, -1, k * sizeof(int));//初始化为-1
	for (j = 0; j < k; j++)if ((huffTree + j)->boom == OFF)*(ss + i++) = (huffTree + j)->weight;
	n = i;
	for (i = 0; i < n - 1; i++)
		for (j = i + 1; j < n; j&