定义: priority_queue< Type, Container,Functional > ,即 ,数据类型,容器类型(默认是vector),比较的方法。默认是大顶堆
// 升序
priority_queue < int ,vector greater >q;
// 降序
priority_queue< int ,vector ,less < int > >q;
#include<iostream>
#include<queue>
using namespace std;
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
int a,b,n,t,ans=0;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>t;
q.push(t);
}
for (int i=0;i<n-1;i++)
{
a=q.top();
q.pop();
b=q.top();
q.pop();
q.push(a+b);
ans+=a+b;
}
cout<<ans;
}