#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<stack>
#include<queue>
using namespace std;
int n,s;
struct cmp
{
bool operator ()(int x, int y)
{
return x > y;
}
};
priority_queue<int,vector<int>,cmp>q;
void fun()
{
while(!q.empty())
q.pop();
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
for(int i=0;i<n;i++)
{
scanf("%d",&s);
q.push(s);
}
__int64 ans=0;
while(q.size()!=1)
{
int t=q.top();
q.pop();
t+=q.top();
q.pop();
q.push(t);
ans+=t;
//printf("%d\n",t);
}
printf("%I64d\n",ans);
fun();
}
return 0;
}
POJ 3253 Fence Repair
最新推荐文章于 2023-03-04 18:57:46 发布