[20251015] BOJ / G1 / 택배 / 이준희 #1126
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/8980
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
트럭의 C 가 정해져 있고 택배는 보내는 마을, 받는 마을, 박스 개수가 존재합니다.
이 때 트럭이 일직선으로 놓은 마을들을 지나가면서 택배를 싣거나 배송할 때
가장 많은 택배를 배송할 수 있는 경우를 구하는 문제입니다.
🔍 풀이 방법
2차원 배열을 받는 마을을 기준으로 정렬한 후
그리디를 이용해서 풀었습니다.
⏳ 회고
처음에 정렬하는 column을 잘못 설정해서 이상한 짓을 했습니다.