[20251002] BOJ / G4 / 사탕 가게 / 김수연 #1024
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/4781
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
사탕의 칼로리와 가격이 주어질 때,
어떻게 하면 칼로리의 합이 가장 크게 되는지 구하기
🔍 풀이 방법
백팩 문제임
dp사용해서 각 사탕 종류가 추가될 때마다 dp배열을 m까지 설정해서 각 가격마다 얻을 수 있는 최대 칼로리로 갱신
⏳ 회고
무슨 부동소수점 때문에 nextDouble() * 100 + 0.5 이거 해야됨
어이없다