[20251108] BOJ / G5 / 기타 레슨 / 이준희 #1351
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/2343
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
기타 레슨 동영상을 블루레이 몇개에 나눠서 팔려고 할 때
블루레이의 크기는 들어가는 동영상 크기의 합 입니다.
블루레이의 개수 제한이 주어졌을 때 블루레이 크기의 최솟값을 구하는 문제입니다.
🔍 풀이 방법
이분탐색으로 풀었습니다.
이분탐색을 시작할 때 최솟값은 동영상 길이의 최댓값이고
최댓값은 모든 동영상 길이의 합으로 하여 횟수를 줄였습니다.
⏳ 회고
뭔가 풀이방법을 떠올리기만 하면 쉬운 문제였던 것 같습니다.