백준 1715 카드 정렬하기

package test;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.PriorityQueue;

public class BaekJoon1715_P199_Q33 {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		int count = Integer.parseInt(br.readLine());
		PriorityQueue<Long> card = new PriorityQueue<>();

		for (int i = 0; i < count; i++) {
			card.add(Long.parseLong(br.readLine()));
		}
		long sum = 0;

		while (card.size() >1) {
			long a = card.poll();
			long b = card.poll();

			sum += (a + b);
			card.add(a + b);
		}

		bw.write(Long.toString(sum));

		bw.flush();

	}

}