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/13904
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
마감기한과 점수가 있는 과제들이 주어지고 하루에 한개의 과제만 수행할 수 있을 때
최대한 많은 점수를 얻을 수 있는 경우의 점수를 구하는 문제입니다.,
🔍 풀이 방법
과제들을 마감기한 내림차순으로 정렬한 후 가장 늦은 마감기한부터 1일까지 역방향으로 순회하였습니다.
각 순회마다 해당 날짜까지 미루다가 수행해도 가능한 모든 과제의 점수를 pq에 넣어서 가장 높은 점수의 과제를 수행할 수 있게 했습니다.
⏳ 회고
날짜와 점수를 모두 생각해야하는 문제였습니다.