백준 11279 : 최대 힙 _자바 Java

https://www.acmicpc.net/problem/11279

11279번: 최대 힙

---

우선순위 큐 사용(내림차순) -> PriorityQueue<Long> pq=new PriorityQueue<>(Collections.reverseOrder());

 

import java.io.*;
import java.util.*;
import java.time.*;

public class Main {

	public static void main(String[] args)throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N =	Integer.parseInt(br.readLine());	//연산의 개수
		PriorityQueue<Long> pq=new PriorityQueue<>(Collections.reverseOrder());
		
		
		for(int i=0;i<N;i++) {	//연산 반복 
			long val = Integer.parseInt(br.readLine());
			if(val>0) {
				pq.add(val);
			}else if(val==0) {
				if(pq.isEmpty())
					System.out.println(0);
				else
					System.out.println(pq.poll());
			}
				
			
		}
		
	}// main()
	
}// class Main