题目：https://www.nowcoder.com/practice/162753046d5f47c7aac01a5b2fcda155?tpId=40&tqId=21520&tPage=2&rp=2&ru=/ta/kaoyan&qru=/ta/kaoyan/question-ranking

注意一下优先队列的写法！！

代码

  1. #include <queue>
  2. #include <vector>
  3. #include <cstdio>
  4. using namespace std;
  6. priority_queue<int, vector<int>, greater<int> > q;
  8. int main(){
  9.     int a;
  10.     while(scanf("%d", &a) != EOF){
  11.         int temp, ans = 0;
  12.         for(int i = 0; i < a; i++) {
  13.             scanf("%d", &temp);
  14.             q.push(temp);
  15.         }
  16.         while(q.size() > 1){
  17.             int x = q.top();
  18.             q.pop();
  19.             int y = q.top();
  20.             q.pop();
  21.             q.push(x + y);
  22.             ans += x + y;
  23.         }
  24.         while(!q.empty()) q.pop();
  25.         printf("%d\n", ans);
  26.     }
  27. }