[20250728] BOJ / G3 / 크게 만들기 / 이강현 #564
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/2812
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
N자리 수에서 K개의 숫자를 빼서 가장 큰 수를 만들기
🔍 풀이 방법
덱?
덱으로 현재값이 덱의 꼭대기보다 크면 꼭대기 값 제거하기
그리고 K개만큼 제거했으면 이제 반대쪽으로 빼내면서 출력하기
⏳ 회고
스택 안쓰고 풀라다가 오래걸림 ㅎ
어떻게 해도 O(N^2) 나오더랑