• 문제 링크
https://www.acmicpc.net/problem/9237
• 풀이 코드
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);
int max = 0;
for (int i = arr.length - 1, j = 1; i >= 0; i--, j++) max = Math.max(max, arr[i] + j);
bw.write(String.valueOf(max + 1));
bw.flush();
}
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' 카테고리의 다른 글
[백준] 33910 합의 최소 - Greedy / Java (0) | 2025.08.02 |
---|---|
[백준] 8731 Sznurki - Greedy / Java (0) | 2025.08.01 |
[백준] 10769 행복한지 슬픈지 - Implementation / Java (0) | 2025.07.30 |
[백준] 11816 8진수, 10진수, 16진수 - Implementation / Java (0) | 2025.07.29 |
[백준] 2804 크로스워드 만들기 - Implementation / Java (0) | 2025.07.28 |
댓글