[20250203] BOJ / 골드5 / 시간 관리 / 설진영 #17
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/1263
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
최대한 늦게 일을 시작하되,
N개의 일들을 정해진 시간 내에 모두 처리해야함
🔍 풀이 방법
마감 시간이 빠른 순서대로 정렬 하고, 각
p.s - nowTime중 최솟값이 정답,nowTime > p.s인 시점부터는 -1 출력 후 얼리 리턴⏳ 회고
그리디인거 미리 몰랐으면 못풀었을 거 같다. 그리디 문제인지 DP 문제인지 판단 하는 실력 좀 길러야겠다