Algorithm/백준
백준 2075 N번째 큰 수
chbong
2024. 7. 25. 22:24
package practice;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Boj2075 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
PriorityQueue<Integer> pq = new PriorityQueue<>(Comparator.reverseOrder());
for(int i = 0 ; i < n ; i ++){
StringTokenizer st = new StringTokenizer(br.readLine(), " ");
while(st.hasMoreTokens()) {
pq.offer(Integer.parseInt(st.nextToken()));
}
}
for(int i = 0 ; i < n-1 ; i ++) {
pq.poll();
}
System.out.println(pq.poll());
}
}