合并果子——记一下 优先队列

priority_queue <int,vector<int>,less<int> > p;
priority_queue <int,vector<int>,greater<int> > q;

{5,4,1,2}
less:{5,4,2,1}
greater:{1,2,4,5}
less是从大到小，greater是从小到大。

#include<bits/stdc++.h>
using namespace std;
priority_queue <int,vector<int>,greater<int>>p;
int a;
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a);
        p.push(a);
    }
    int x,y;
    int ans=0;
    while(p.size()!=1){
        x=p.top();
        p.pop();
        y=p.top();
        p.pop();
        ans+=x+y;
        p.push(x+y);
    }
    printf("%d",ans);
    return 0;
}