NJU-高级算法-时间与收益

SSSStan2090

于 2019-12-08 14:05:20 发布

阅读量364

点赞数

CC 4.0 BY-SA版权

分类专栏： NJU-高级算法

本文链接：https://blog.youkuaiyun.com/YooTechfreak/article/details/103444206

这篇博客探讨了一个优化问题，如何在每个任务都需1单位时间完成且只能同时进行一个任务的情况下，根据给定的截止日期和利润，最大化总利润。任务按利润降序排列，尝试将其安排在尽可能晚的截止日期，以便为早截止日期的任务腾出时间。通过贪心策略，使用一个数组记录每天的收益，最终输出完成的任务数量和最大利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Given a set of n jobs where each job i has a deadline and profit associated to it. Each job takes 1 unit of time to complete and onlyone job can be scheduled at a time. We earn the profit if and only if the job is completed by its deadline. The task is to find the maximum profit and the number of jobs done.

Input

The first line of input contains an integer T denoting the number of test cases.Each test case consist of an integer N denoting the number of jobs and the next line consist