문제 설명

문제 분석

슈도코드

구현

public class 카드_정렬하기_1715 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        Queue<Integer> q = new PriorityQueue<>();
        for (int i = 0; i < N; i++) {
            q.add(scan.nextInt());
        }

        int sum = 0;
        while (q.size() != 1) {
            int data1 = q.poll();
            int data2 = q.poll();

            sum += data1 + data2;
            q.add(sum);
        }

        System.out.println(sum);
    }
}