HDU-1789-Doing Homework again（贪心）

最新推荐文章于 2020-07-10 11:18:44 发布

Prim233

最新推荐文章于 2020-07-10 11:18:44 发布

阅读量295

点赞数

CC 4.0 BY-SA版权

分类专栏：贪心算法语言入门

本文链接：https://blog.csdn.net/qq_32680617/article/details/52816005

语言入门同时被 2 个专栏收录

63 篇文章

订阅专栏

贪心算法

42 篇文章

订阅专栏

本篇介绍了一个经典的贪心算法问题：如何合理安排多门课程的作业提交顺序，以达到最小化因延期提交而造成的总扣分。通过优先考虑扣分高的作业，并在相同扣分情况下选择截止日期更远的作业先做，实现了最优解决方案。

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

Doing Homework again

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12044 Accepted Submission(s): 7083

Problem Description
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing everyone homework always takes one day. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.

Input
The input contains several test cases. The first line of the input is a single integer T that is the number of test cases. T test cases follow.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced scores.

Output
For each test case, you should output the smallest total reduced score, one line per test case.

Sample Input
3
3
3 3 3
10 5 1
3
1 3 1
6 2 3
7
1 4 6 4 2 4 3
3 2 1 7 6 5 4

Sample Output
0
3
5

太水，直接上代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
//经典贪心
const int maxn=1005;
struct node
{
    int day;
    int score;
} num[maxn];
int flag[maxn];
bool cmp(node x,node y)
{
    if(x.score==y.score)
        return x.day>y.day;
    return x.score>y.score;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int N;
        scanf("%d",&N);
        for(int i=1; i<=N; i++)
            scanf("%d",&num[i].day);
        for(int i=1; i<=N; i++)
            scanf("%d",&num[i].score);
        sort(num+1,num+N+1,cmp);
        memset(flag,0,sizeof(flag));//初始化所有天都没被占用
        int result=0;//失去的最小分数
        for(int i=1; i<=N; i++)
        {
            int flag_day=num[i].day;
            while(flag[flag_day]==1)
                flag_day--;
            if(flag_day==0)//没找到合适的时间写作业
                result+=num[i].score;
            else
                flag[flag_day]=1;//找到合适的时间写作业
        }
        printf("%d\n",result);
    }
    return 0;
}