#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<functional>
#include<vector>
using namespace std;
struct node
{
friend bool operator< (node n1, node n2)
{
return n1.priority < n2.priority;
}
int priority;
int value;
};
int main()
{
priority_queue<int, vector<int>, greater<int> > q;//优先队列从小到大
priority_queue<int> q2;//优先队列从大到小
int n;
scanf("%d",&n);
int num;
for(int i=0;i<n;i++)
{
scanf("%d",&num);
q.push(num);
}
int a,b,sum=0;
for(int j=0;j<n-1;j++)
{
a=q.top();
q.pop();
b=q.top();
q.pop();
q.push(a+b);
sum+=(a+b);
}
printf("%d",sum);
return 0;
}
优先队列——代码
最新推荐文章于 2024-04-24 22:52:50 发布