Open
Conversation
cnvxlns
reviewed
Apr 1, 2026
| cout << pq.size() << "\n"; | ||
| } | ||
| } | ||
|
|
Collaborator
There was a problem hiding this comment.
pq로 구현하면 복잡할거라고 생각했는데 오히려 정말 쉽네요. 잘 봤습니다.
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.
A: 문자열 길이가 5의 배수인지 아닌지 확인 후 Yes, No 출력, 영어 독해 이슈로 WA 2번 받음..
B: 2xM 크기의 배열을 만든 후 들어온 숫자를 인덱스로 해서 등장 횟수를 기록하고 뒷배열에서 앞배열을 뺀 결과값 출력
C: 우선순위 큐에 오름차순 정렬로 나무 높이를 넣고, 뺄 때는 h 이하까지 모두 빼주면서 길이 출력