[SW Expert Acamdey] 힙 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV-Tj7ya3jYDFAXr&categoryId=AV-Tj7ya3jYDFAXr&categoryType=CODE&problemTitle=%ED%9E%99&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1&&&&&&&&&

SW Expert Academy

 

import java.util.Collections;
import java.util.PriorityQueue;
import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();

			PriorityQueue<Integer> q = new PriorityQueue<>(Collections.reverseOrder());
			//((o1,o2)->(o2-o1))

			StringBuilder sb = new StringBuilder();

			for (int i = 0; i < n; i++) {
				int op = sc.nextInt();

				if (op == 1) {
					int num = sc.nextInt();
					q.add(num);
				} else {
//					if (q.isEmpty()) {
//						sb.append("-1 ");
//					}
//					else sb.append(q.poll()+" ");
					sb.append(q.isEmpty() ? "-1 " :q.poll() + " ");
				}
			}
			System.out.println("#" + tc + " " + sb);

		}

	}
}