[20251001] PGM / LV2 / 광물 캐기 / 김수연 #1019
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://school.programmers.co.kr/learn/courses/30/lessons/172927
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
철, 돌, 다이아 곡괭이 중에 하나 선택해서 광물을 캘 때,
마인이 작업을 끝내기까지 필요한 최소한의 피로도 구하기
🔍 풀이 방법
priorityQueue 이용
가장 힘든 그룹부터 좋은 곡괭이 배정하면서 누적 피로도 계산했음
다이아, 철, 돌 순으로 남은 곡괭이 배정
⏳ 회고
천천히 구현하면 된다