[20251127] BOJ / G5 / 강의실 / 이준희 #1525
Merged
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/1374
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
강의의 시작시간, 종료시간이 주어졌을 때
최소한의 강의실 개수로 강의를 모두 마칠 수 있는 강의실의 개수를 구하는 문제입니다.
🔍 풀이 방법
강의실 클래스를 만들어서 pq를 이용했습니다.
우선 시작순으로 정렬한 후 다음 강의가 현재 강의가 끝나는 시간보다 빨리 시작하면 강의실이 1개 더 필요한 것으로 쳤습니다.
⏳ 회고
기본적인 그리딩비니다