BOJ | BinarySearch[1654] > 랜선 자르기

JavaStudy44.java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        int K = Integer.parseInt(st.nextToken());
        int N = Integer.parseInt(st.nextToken());

        int[] arr = new int[K];

        for (int i = 0; i < K; i++) {
            arr[i] = Integer.parseInt(br.readLine());
        }

        Arrays.sort(arr);
        
        long min = 1;
        long mid = 0;
        long max = arr[arr.length-1];

        while (min <= max) {
            mid = min - (min - max) / 2;

            long count = 0;
            for (int i = 0; i < arr.length; i++) {
                count += (arr[i] / mid);
            }

            if (count >= N) {
                min = mid + 1;
            } else {
                max = mid - 1;
            }
        }

        System.out.println(min - 1);
    }
}