acwing148. 合并果子(贪心)

思路

1. 贪心合并的小的。

代码

#include <bits/stdc++.h>
using namespace std;
#define db  double
#define ll  long long
#define Pir pair<int, int>
#define fi  first
#define se  second
#define pb  push_back
#define m_p make_pair
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
/*==========ACMer===========*/
priority_queue<int, vector<int>, greater<int>> q;


int main()
{
    
    
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; i ++)
    {
    
    
        int x; scanf("%d", &x);
        q.push(x);
    }

    int ans = 0;
    while (q.size() > 1)
    {
    
    
        int x = q.top(); q.pop();
        int y = q.top(); q.pop();
        q.push(x + y);
        ans += x + y;
    }

    printf("%d\n", ans);



    return 0;
}