java로 최대/최소 힙 구현 -> PriorityQueue 사용 import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N; N = Integer.parseInt(br.readLine()); int num; PriorityQueue pq = new PriorityQueue((a,b)->(b-a)); StringBuilder sb = new StringBuilder(); for (int i = 0; i < N; i..
