[20260112] BOJ / G2 / 저울 / 한종욱 #1788
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/2437
🧭 풀이 시간
100분
👀 체감 난이도
✏️ 문제 설명
추들이 있는데, 이것들을 합해서 나타낼 수 없는 최소 무게는?
🔍 풀이 방법
weight[i] > sum+1인지 체크한다.⏳ 회고
이어달리기 느낌의 문제였다. 1부터 sum까지 만들 수 있다고 가정하고
weight가 들어왔을 때, 어떻게 해야하나? 를 생각하면 되는 문제였다.