algorithmStudy/13975.cpp at master · judy5050/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
//
//  13975.cpp
//  algo
//
//  Created by 박효정 on 2021/06/22.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;

int main(){

    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);


    int k;
    cin>>k;

    while(k--){
        long long res=0;
        int num;
        cin>>num;
        priority_queue<long long,vector<long long>,greater<long long>>pq;
        for(int i=0;i<num;i++){
            int a;
            cin>>a;
            pq.push(a);
        }
        while(!pq.empty()){
            if(pq.size()>=2){
                long long n1=pq.top();
                pq.pop();
                long long n2=pq.top();
                pq.pop();
                long long s=n1+n2;
                res+=s;
                pq.push(s);
            }else{
                pq.pop();

            }


        }

        cout<<res<<"\n";

    }


    return 0;
}