[20250909] BOJ / G5 / 벼락치기 / 이준희 #850
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/14728
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
단원이 융햡된 문제가 존재하지 않고, 각 단원 별로 1문제씩만 출제되는 시험이 있습니다.
이 때 총 공부 가능한 시간과
각 단원별 공부가 필요한 시간, 배점이 주어졌을 때
가장 고득점인 경우의 점수를 출력하는 문제입니다.
🔍 풀이 방법
dp를 이용해서 풀었습니다.
최대 시간 부터 각 단원을 공부해야하는 시간 k까지 역으로 순회하며 dp를 갱신했습니다
⏳ 회고
기본적인 dp 문제였습니다