哈夫曼树求WPL板子复习
作者:
巷港
,
2022-04-08 16:46:32
,
所有人可见
,
阅读 230
合并果子
#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
priority_queue<int,vector<int>,greater<int> >heap;
int n;
cin>>n;
for (int i=0;i<n;i++)
{
int x;
cin>>x;
heap.push(x);
}
int ans=0;
while (heap.size()>1)
{
int a = heap.top();
heap.pop();
int b = heap.top();
heap.pop();
heap.push(a+b);
ans+=a+b;
}
cout<<ans<<endl;
return 0;
}
哈夫曼树
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
int n;
int main()
{
priority_queue<int,vector<int>,greater<int> >heap;
cin>>n;
for (int i=0;i<n;i++)
{
int x;
cin>>x;
heap.push(x);
}
int ans=0;
while (heap.size()>1)
{
int a = heap.top();
heap.pop();
int b = heap.top();
heap.pop();
heap.push(a+b);
ans+=a+b;
}
cout<<ans<<endl;
return 0;
}