선발대

프로그래머스: 입국심사 (링크) # 풀이 참고def solution(n, times): left = 1 right = max(times) * n while left = n: break if people >= n: answer = mid right = mid - 1 else: left = mid + 1 return answer참고한 블로그: https://velog.io/@jqdjhy/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EC%9E%85%EA%B5%AD%EC%8B%AC%EC%82%AC..