[Programmers] 입국심사

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

프로그래머스

 

1. Python

def solution(n, times):
    ret = max(times) * n
    left, right = 0, ret
    while left <= right:
        mid = (left + right) // 2
        cnt = 0
        for time in times:
            cnt += int(mid // time)
        if cnt < n:
            left = mid + 1
        else:
            ret = min(ret, mid)
            right = mid - 1
    return ret

 

2. C++

long long solution(int n, vector<int> times) {
    long long ret = (long long) *max_element(times.begin(), times.end()) * n;
    long long left = 0, right = ret;
	while (left <= right) {
		long long mid = (left + right) / 2;
		long long cnt = 0;
		for (long long time : times) {
			cnt += mid / time;
		}
		if (cnt < n) {
			left = mid + 1;
		} else {
			ret = min(ret, mid);
			right = mid - 1;
		}
	}
	return ret;
}