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/1727
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
남자 N명과 여자 M명을 짝지어 줄 때,
각 커플의 성격 차이의 합이 최소가 되도록 하기
🔍 풀이 방법
N == M이면 남자와 여자를 오름차순으로 정렬한 후, 순서대로 매칭시켜주는게 합이 최소가 된다.
N > M이면 N의 마지막부분을 포함할 때와 하지 않을 때를 비교해서 최솟값으로 초기화 시켜준다.
N < M일 때도 마찬가지다.
⏳ 회고
dp라는 건 알았는데, 정확히 어떻게 사용해야할지 몰라서 힌트를 보고 풀었다.
dp는 넘나 어렵당....