이분법
def solution(n, times):
answer, m = 0, len(times)
begin, end = 0, n * max(times)
while begin <= end:
mid = (begin + end) // 2
pN = 0
for i in range(0, m):
pN += mid // times[i]
if pN < n: begin = mid + 1
else:
end = mid - 1
answer = end
return begin