본문 바로가기
Problem Solving/Baekjoon

[백준] 9237 이장님 초대 - Greedy / Java

by graycode 2025. 7. 31.

 문제 링크

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;
    }

}

댓글