[20251203] BOJ / G5 / 최소 회의실 개수 / 이준희 #1574
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/19598
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
회의의 시작시간, 끝시간이 주어졋을 때
회의를 진행하는 데 필요한 최소 회의실 개수를 구하는 문제입니다.
🔍 풀이 방법
회의를 시작시간 순으로 정렬한 후 다음 회의 시작 시간이 끝시간 보다 빠르면 회의실이 1개 더 필요한 식으로
그리디로 풀었습니다.
⏳ 회고
기본중의 기본 그리디였습니다.