[20251016] BOJ / G1 / 택배 / 김민진 #1141
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.
🧷 문제 링크
택배
🧭 풀이 시간
100분
👀 체감 난이도
✏️ 문제 설명
출발지부터 오른쪽으로 택배를 배송하는데 가장 많이 배달했을 때의 택배 총 갯수
🔍 풀이 방법
그리디..
도착지가 가까운 택배부터 실어야하기 때문에 그렇게 정렬
첫 번째 마을 택배배부터 마지막까지 순차적으로 실어봄
만약 택배를 전부 싣지 못하면
N부터cur.to까지 확인해보면서 멀리 있는 택배 실은 거 빼버리기⏳ 회고
회의실 배정 문제랑 비슷한 듯 아닌 듯~~..
진짜 개어렵네,,,,,,,