[20251109] BOJ / P5 / 집배원 한상덕 / 한종욱 #1359
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/2842
🧭 풀이 시간
100분
👀 체감 난이도
✏️ 문제 설명
각 고도끼리의 높이차가 있고 모든 배달을 했을 때, 피로도가 가장 낮은 것을 출력하라.
🔍 풀이 방법
높이에 대해서 먼저 정렬하고, 이중 for문으로 투포인터를 실행한다. minH와 maxH를 정하고 이 높이로만 K개를 배달할 수 있을지 확인한다.
⏳ 회고
BFS보다도 다른 사고가 필요했다. 투 포인터를 좀 집중적으로 공부해야겠다. 내가 잘 못하네.