[Java] 백준 1927번 문제 (최소 힙)

문제설명

 

소스코드

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.PriorityQueue;
public class Main
{
    public static void main(String[] args) throws Exception
    {
    	PriorityQueue<Integer> maxHeap = new PriorityQueue<>();
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringBuilder sb = new StringBuilder();
    	int N = Integer.parseInt(br.readLine());
    	for(int i = 0; i < N; ++i)
    	{
    		int input = Integer.parseInt(br.readLine());
    		if(input == 0)
    		{
    			if(maxHeap.peek() == null) sb.append(0).append("\n");
    			else sb.append(maxHeap.poll()).append("\n");
    		}
    		else maxHeap.add(input);
    	}
    	System.out.println(sb.toString());
    }
}

 

설명

2023.10.22 - [Java Category/Java] - [Java] Heap(힙)과 Priority Queue(우선순위 큐)

[Java] Heap(힙)과 Priority Queue(우선순위 큐)