[20251114] BOJ / G5 / 최소 회의실 개수 / 설진영 #1409
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
Implement a Java program to calculate the minimum number of meeting rooms required based on start and end times of meetings.
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
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
N개의 회의를 모두 진행할 수 있는 최소 회의실 개수 구하기
🔍 풀이 방법
회의를 시작 시간 기준으로 정렬, 우선순위 큐에 회의실 종료 시간 저장
3가장 빨리 끝나는 회의실 종료시간 보다 새 회의 시작시간이 크면 재사용, 아니면 추가
큐 크기 = 필요한 회의실 개수
⏳ 회고
그리디같이 생김