Skip to content

Commit 01aa6f4

Browse files
feat: 백준 최대힙 문제 풀이
``` [최대 힙](https://www.acmicpc.net/problem/11279) ```
1 parent a82c249 commit 01aa6f4

File tree

1 file changed

+35
-0
lines changed

1 file changed

+35
-0
lines changed
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
package sgyj.backjun.seunggu;
2+
3+
import java.io.BufferedReader;
4+
import java.io.IOException;
5+
import java.io.InputStreamReader;
6+
import java.util.Collections;
7+
import java.util.PriorityQueue;
8+
9+
public class Main11279 {
10+
11+
public static void main(String[] args) {
12+
try( BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) {
13+
PriorityQueue<Integer> queue = new PriorityQueue<>(Collections.reverseOrder());
14+
int count = Integer.parseInt(reader.readLine());
15+
StringBuilder stringBuilder =new StringBuilder();
16+
for(int i=0; i<count; i++) {
17+
int num = Integer.parseInt(reader.readLine());
18+
if(num == 0) {
19+
if(queue.isEmpty()) {
20+
stringBuilder.append(0);
21+
} else {
22+
stringBuilder.append(queue.poll());
23+
}
24+
stringBuilder.append("\n");
25+
} else {
26+
queue.offer(num);
27+
}
28+
}
29+
System.out.println(stringBuilder);
30+
} catch (IOException e) {
31+
e.printStackTrace();
32+
}
33+
}
34+
35+
}

0 commit comments

Comments
 (0)