7-11 哈夫曼树 (25 分)
哈夫曼树,第一行输入一个数n,表示叶结点的个数。
需要用这些叶结点生成哈夫曼树,根据哈夫曼树的概念,这些结点有权值,即weight,题目需要输出哈夫曼树的带权路径长度(WPL)。
输入格式:
第一行输入一个数n,第二行输入n个叶结点(叶结点权值不超过1000,2<=n<=1000)。
输出格式:
在一行中输出WPL值。
输入样例:
5
1 2 2 5 9
输出样例:
37
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<int, vector<int> ,greater<int> > q;
int m, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &m);
q.push(m);
}
for (int k = 0; k < n - 1; k++) {
int h1=q.top();
q.pop();
int h2=q.top();
q.pop();
sum+=h1+h2;
q.push(h1+h2);
}
cout << sum << endl;
return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef struct
{
int weight;
int lchild, rchild, parent;
} HNode;
HNode HNodeArray[2000];
void CreateHuffTree(int n) {
///初始化
for (int i = 0; i < 2 * n - 1; i++) {
HNodeArray[i].lchild = HNodeArray[i].rchild = HNodeArray[i].parent = -1;
}
for (int i = 0; i < n; i++) {
scanf("%d", &HNodeArray[i].weight);
}
///每次找最小的两个结点
int a, b; //a<b,下标
int a1, b1; ///ab对应的较小的两个值
for (int k = 0; k < n - 1; k++) {
a1 = b1 = INT_MAX;
for (int i = 0; i < n + k; i++) {
if (HNodeArray[i].parent == -1) {
if (HNodeArray[i].weight < a1) {
b = a;
a = i;
b1 = a1;
a1 = HNodeArray[i].weight;
}
else if (HNodeArray[i].weight < b1) {
b = i;
b1 = HNodeArray[i].weight;
}
}
}
///找完了
HNodeArray[n + k].weight = HNodeArray[a].weight + HNodeArray[b].weight;
//cout<<HNodeArray[n+k].weight<<endl;
HNodeArray[n + k].lchild = a;
HNodeArray[n + k].rchild = b;
HNodeArray[a].parent = HNodeArray[b].parent = n + k;
}
}
int main() {
int n;
cin >> n;
CreateHuffTree(n);
int sum = 0;
for (int i = n; i < 2 * n - 1; i++) {
sum += HNodeArray[i].weight;
}
cout << sum << endl;
return 0;
}