148. 合并果子
题目链接https://www.acwing.com/problem/content/150/
题目:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
priority_queue<int ,vector<int>,greater<int>> q;
int main(){
int n,a;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
q.push(a);
}
int res=0;
while(q.size()!=1){
int x,y;
x=q.top();
q.pop();
y=q.top();
q.pop();
res+=x+y;
q.push(x+y);
}
cout<<res;
return 0;
}