[백준] BOJ - 2075 N번째 큰 수 java (실버2)

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

2075번: N번째 큰 수

 

 

나의풀이

import java.io.*;
import java.util.*;
public class Main {
    public static void main(String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer st = new StringTokenizer(br.readLine());
        PriorityQueue<Integer> q = new PriorityQueue<>(); 
        //PriorityQueue<Integer> q = new PriorityQueue<>(Collections.reverseOrder());  최대 힙 구성을 위해 -1곱할 필요없이 이렇게 선언해도됨
        int n= Integer.parseInt(st.nextToken());
        for(int i=0; i<n ; i++){
            st = new StringTokenizer(br.readLine());
            for(int j=0; j<n; j++){
                int temp = Integer.parseInt(st.nextToken());
                q.add(temp * (-1)); //최대힙으로 구성하기 위해 음수로 넣기
            }
        }
        int answer=0;
        for(int i=0; i<n; i++){
            answer=q.peek();
            q.remove(answer);
        }
        
        bw.write(Integer.toString(answer * (-1)));
        bw.flush();
        br.close();
        bw.close();
    
    }
}