[20250929] PGM / LV2 / 디펜스 게임 / 김수연 #1000
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/142085
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
준호는 처음에 병사 n명을 가지고 있고, 매 라운드마다 enemy[i]만큼의 적의 등장함
그리고 병사 소모 없이 막을 수 있는 무적권 k개가 주어질 때,
준호가 최대 몇 라운드까지 버틸 수 있는지 구하기
🔍 풀이 방법
priorityQueue 사용
큐에 k만큼의 적을 계속 추가하고, 새로운 적이 현재 큐에 저장되어 있는 가장 적은 적보다 크면 바꿈
그리고 n의 값이 0보다 작아지면 return
⏳ 회고
코드를 간단히 적는게 낫구나