• 문제 링크
https://www.acmicpc.net/problem/22282
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int[] arr = new int[read()];
for (int i = 0; i < arr.length; i++) arr[i] = read();
Arrays.sort(arr);
bw.write(String.valueOf(find(arr)));
bw.flush();
}
private static int find(int[] arr) {
for (int i = 0; i < arr.length; i++) if (arr[arr.length - i - 1] <= i) return i;
return arr.length;
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 9770 GCD - Brute Force / Java (0) | 2025.07.24 |
---|---|
[백준] 16955 오목, 이길 수 있을까? - Brute Force / Java (0) | 2025.07.23 |
[백준] 16960 스위치와 램프 - Brute Force / Java (0) | 2025.07.21 |
[백준] 9182 Biorhythms - Brute Force / Java (0) | 2025.07.20 |
[백준] 30306 Better Dice - Brute Force / Java (0) | 2025.07.19 |
댓글