[문제] 백준 11279번 최대 힙, 1927번 최소 힙

www.acmicpc.net/problem/11279

11279번: 최대 힙

풀이

public class BOJ_11279 {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		int N = Integer.parseInt(in.readLine());
		PriorityQueue<Integer> heap = new PriorityQueue<>(N, new Comparator<Integer>() {
			public int compare(Integer i1, Integer i2) {
				return i2.compareTo(i1);
			}
		});
		
		for(int i=0;i<N;i++) {
			int num = Integer.parseInt(in.readLine());
			if(num == 0) {
				if(heap.size() == 0) {
					sb.append("0").append("\n");
				}else {
					sb.append(heap.poll()).append("\n");
				}
			}else {
				heap.add(num);
			}
		}
		System.out.println(sb);
	}
}

www.acmicpc.net/problem/1927

1927번: 최소 힙

풀이

public class BOJ_1927 {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		int N = Integer.parseInt(in.readLine());
		PriorityQueue<Integer> heap = new PriorityQueue<>();
		for(int i=0;i<N;i++) {
			int num = Integer.parseInt(in.readLine());
			if(num == 0) {
				if(heap.size() == 0) {
					sb.append("0").append("\n");
				}else {
					sb.append(heap.poll()).append("\n");
				}
			}else {
				heap.add(num);
			}
		}
		System.out.println(sb);
	}
}