입국심사 (이분탐색)

원본 : https://school.programmers.co.kr/learn/courses/30/lessons/43238

프로그래머스

 

풀이

class Solution {
    public long solution(int n, int[] times) {
        long left = 0;
        long right = 0;
        long answer = Long.MAX_VALUE;

        for (long time : times) {
            right = Math.max(right, n * time);
        }

        while (left <= right) {
            long mid = (left + right) / 2;
            long sum = 0;

            for (long time : times) {
                sum += mid / time;
            }

            if (sum >= n) {
                right = mid - 1;
                answer = Math.min(answer, mid);
            } else {
                left = mid + 1;
            }
        }

        return answer;
    }
}