[Heap] 최소 힙, 최대 힙

백준 11279 최소 힙

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

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.PriorityQueue;

public class Main {

    static PriorityQueue<Integer> pq = new PriorityQueue<>();

    public static void main(String[] args) throws Exception{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt( br.readLine() );

        for(int i=0; i<N ;i++){
            int input = Integer.parseInt(br.readLine());

            if(input==0){
                if(!pq.isEmpty()) System.out.println( pq.poll() );
                else System.out.println(0);
            }else{
                pq.offer(input);
            }
        }
    }
}

백준 11279 최대 힙

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

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.PriorityQueue;

public class Main {

    static PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

    public static void main(String[] args) throws Exception{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt( br.readLine() );

        for(int i=0; i<N ;i++){
            int input = Integer.parseInt(br.readLine());

            if(input==0){
                if(!pq.isEmpty()) System.out.println( pq.poll() );
                else System.out.println(0);
            }else{
                pq.offer(input);
            }
        }
    }
}

여기만 다르다

static PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());