[20250206] BOJ / 골드3 / 같이 눈사람 만들래? / 김수연 #47
Merged
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/20366
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
눈덩이 N개 중에 4개를 골라서 눈사람 2개를 만드는데 눈사람 2개의 최소 높이 차를 return한다.
🔍 풀이 방법
눈덩이 N개 중에 2개를 combination으로 고르고,
투포인터를 이용해서 기존의 눈덩이 2개와 겹치지 않는 나머지 2개의 눈덩이를 선택한다.
⏳ 회고
풀이법은 간단한데, 너무 복잡하게 생각해서 시간이 꽤 걸렸다.