题意:大概就是对给出的序列Ai,求最小的哈夫曼树
分析:对于最小哈夫曼树的求解,只需要维护一个堆,每次从堆中取出最小的两个元素a+b,将a+b累加入答案,并把a+b入堆。
因为priority_queue是基于堆(大顶堆)实现的, 可以加一个greater 实现小顶堆
注意爆Int 用long long
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <queue>
#include <cmath>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <sstream>
#include <functional>
#include <algorithm>
using namespace std;
#define mem(a,n) memset(a,n,sizeof(a))
#define memc(a,b) memcpy(a,b,sizeof(b))
#define rep(i,a,n) for(int i=a;i<n;i++) ///[a,n)
#define dec(i,n,a) for(int i=n;i>=a;i--)///[n,a]
#define pb push_back
#define IO ios::sync_with_stdio(false)
#define fre freopen("in.txt","r",stdin)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
typedef unsigned long long ull;
const double PI=acos(-1.0);
const double eps=1e-8;
const double e=2.7182818;
const int INF=0x3f3f3f3f;
const int MOD=998244353;
const int N=1e5+5;
const ll maxn=5e4;
const int dir[4][2]= {-1,0,1,0,0,-1,0,1};
priority_queue<ll,vector<ll>,greater<ll> >pq;
void solve()
{
ll ans=0;
while(pq.size()>1)
{
int t1=pq.top();
pq.pop();
int t2=pq.top();
pq.pop();
ans+=t1+t2;
pq.push(t1+t2);
}
cout<<ans<<endl;
}
int main()
{
IO;
int T;
cin>>T;
while(T--)
{
while(!pq.empty()) pq.pop();
ll n,x;
cin>>n;
rep(i,0,n) cin>>x,pq.push(x);
solve();
}
return 0;
}