Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/43238
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
n명이 입국심사를 하려고 할 때, 각 심사관이 한 명을 심사하는데 걸리는 시간이 담긴 배열 times가 주어진다.
모든 사람이 심사를 받는데 걸리는 시간의 최솟값 구하기
🔍 풀이 방법
이분탐색 사용
n이 1000000000이하이고, 심사관이 심사하는데 걸리는 시간도 최대 1000000000이하여서 long으로 설정해야 해야함
⏳ 회고
문제 조건 잘보자