[20250819] BOJ / G4 / 도서관 / 김수연 #692
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://www.acmicpc.net/problem/1461
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
세준이와 책이 전부 0에 있을 때,
책들을 최소 걸음 수로 전부 제자리에 가져다 놓는 걸음 수 구하기
🔍 풀이 방법
priorityQueue 사용
우선순위 큐를 양수, 음수 2개로 만들어서 M개마다의 최댓값을 구해서 answer에 더해줌
⏳ 회고
제일 마지막꺼는 갔다가 안돌아와도 되지만, 다른거는 갔다가 다시 0으로 돌아와야 해서 2를 곱해줘야 함