Merged
Conversation
Contributor
|
ㄷㄷㄷㄷㄷ |
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
3 participants
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/12927
🧭 풀이 시간
5분
👀 체감 난이도
✏️ 문제 설명
1시간에 일은 1만큼 할 수 있음.
일을 n시간만큼 하고 남은 일들을 제곱하여 피로도를 구할때, 피로도가 최소가 되는 값을 구하자.
🔍 풀이 방법
우선순위 큐
그냥 더하는 것보다 제곱해서 더해지는게 무조건 크기때문에 남은 일중 가장 많이 남은 일부터 해야한다.
따라서 매 시간마다 가장 많이 남은 일을 뽑아내야하고 크기를 유지하기위해 우선순위 큐를 사용했다.
⏳ 회고
ez