Merged
Conversation
[20250218] BOJ / 골드5 / 시간 관리하기 / 김수연
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
2 participants
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/6068
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
존이 모든 일을 제 시간에 끝낼 수 있는 한도에서 존이 가장 늦게 일어나도 되는 시간 구하기
🔍 풀이 방법
마감시간이 빠른 순으로 정렬을 한후,
answer이라는 시간을 1씩 줄여가며 모든 일을 끝낼 수 있는 최대의 시간을 구함
⏳ 회고
예전에 비슷한 문제를 풀었어서 보자마자 풀었다.