https://school.programmers.co.kr/learn/courses/30/lessons/43238
def solution(n, times):
answer = 0
right = max(times) * n
left = 0
while left < right :
m = (left+right) // 2
left, right = (left, m) if n <= sum(m//i for i in times) else (m+1, right)
return left