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
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/19640
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
기존에서있는 화장실 줄을 n개의 줄로 나누고, 우선순위에 따라 화장실을 이용한다고 할 때,
데카는 몇번째에 화장실을 이용할 수 있는지 구하기
🔍 풀이 방법
Person 객체에 우선순위에 따른 compareTo 메서드를 오버라이딩하고, M 만큼 Queue 배열을 만든다.
각 큐의 첫번째 요소들을 모두 빼서 하나의 큰 우선순위큐에 집어넣고, 하나씩 빼면서 빠진 사람의 라인에 있는 줄(queue)에서 한명을 빼서 다시 넣어준다.
⏳ 회고
문제를 잘 읽자. 무턱대고 구현부터 하다가 몇번 갈아엎음. 만능 ArrayDeque 를 애용하자.