[20250908] BOJ / G5 / 입국심사 / 이준희 #842
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
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://www.acmicpc.net/problem/3079
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
입국 심사대가 N개 있고 K번 심사대는 각각 Tk의 시간이 걸립니다.
이 때 M명의 사람이 모두 입국심사를 마치는 최소 시간을 구하는 문제입니다.
🔍 풀이 방법
이분탐색을 이용하여 풀었습니다.
⏳ 회고
놀이공원 문제와 똑같은 문제였습니다.
접근법을 알고 있어서 로직은 엄청 빨리 나왔는데
long에 저장할 때 10억을 100억으로 착각해서 틀려버렸습니다