题目链接:
http://acm.nyist.net/JudgeOnline/problem.php?pid=55
这里有先优先队列的简单介绍:
http://blog.csdn.net/a_eagle/article/details/7371974
http://blog.csdn.net/a_eagle/article/details/7400143
没事切切水题,
思路:只要让每次都找两个最小的进行合并,小明花费的力气才是最小的。
AC code:
#include<stdio.h>
#include<queue>
#include<algorithm>
using namespace std;
struct comp
{
bool operator()(int &x,int &y)/*设定优先级,小的数优先出队列*/
{
return x>y;
}
};
priority_queue<int,vector<int>,comp>s;/*优先队列*/
int a[100001];
int main()
{
int ncases,n,i,x,y,sum;
scanf("%d",&ncases);
while(ncases--)
{
sum=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s.push(a[i]);
}
while(s.size()!=1)
{
x=s.top();
s.pop();
y=s.top();
s.pop();
x=x+y;
sum=sum+x;
s.push(x);
}
while(!s.empty())
{
s.pop();
}
printf("%d\n",sum);
}
return 0;
}