[20251103] BOJ / G1 / 난민 / 김민진 #1303
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.
🧷 문제 링크
난민
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
대피소가 주어질 때마다 모든 대피소에서 정수시설까지의 거리 합이 최소가 되는 지점에 정수시설을 건설함
새로운 대피소가 들어설 때마다 정수시설의
y값과 거리 합의 최솟값 출력🔍 풀이 방법
최소힙 + 최대힙
⏳ 회고
케이스마다 모든 거리의 합을 구하면 시간초과가 나서 변경된 값의 차만 반영함