#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll sum=0;
priority_queue<ll,vector<ll>,greater<ll>>q;
for(ll i=1;i<=n;i++)
{
ll a;
cin>>a;
q.push(a);
}
while(q.size()>1)
{
ll x=q.top();
q.pop();
ll y=q.top();
q.pop();
ll z=x+y;
sum+=z;
q.push(z);
}
cout<<sum;
}
小明的衣服——优先队列
最新推荐文章于 2024-06-13 23:56:26 发布