哈夫曼树解决问题2127 2423

异曲同工
#include
#include
#include
#define N 20000
using namespace std;
int main()
{
int t, i;
int l[N];
long long sum = 0;
scanf("%d", &t);
priority_queue<int, vector, greater > que;
for (i = 0; i < t; i++)
{
scanf("%d", &l[i]);
que.push(l[i]);
}
while (que.size()>1)
{
int m = que.top();
que.pop();
int n = que.top();
que.pop();
sum += m + n;

	que.push(m + n);

}
printf("%lld\n", sum);
return 0;

}

/#include
#include
#include
#include
using namespace std;
int main()
{
priority_queue<int, vector,greater >q;
int n,i,num,a,b,c,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num);
q.push(num);
}
while(!q.empty())
{
a=q.top();
q.pop();
if(!q.empty())
{
b=q.top();
q.pop();
c=a+b;
q.push©;
sum+=c;
}
}
printf("%d",sum);
return 0;
}/