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/2212
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
센서의 거리가 주어지고 센서와 통신하는 K개의 집중국으로 모든 센서를 커버해야 할 때 집중국의 수신가능 영역 길이의 합의 최소값을 구하는 문제입니다.
🔍 풀이 방법
각 센서의 좌표를 오름차순으로 정렬한 후 센서간의 거리 차이 배열을 만들었습니다.
이후 거리 차이 배열도 오름차순으로 정렬한 후
N-K개의 거리차이들을 더한 값을 출력했습니다.
⏳ 회고
처음에 집중국을 어디에 둘지 고민했었는데 거리차이를 이용하는 아이디어를 떠올리기가 쉽지 않았던 것 같습니다.