hdu 1789 Doing Homework again

题目描述：
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.
（译文：伊格内修斯刚从第30届ACM/ICPC回来。现在他有很多作业要做。每个老师给他交作业的最后期限。如果伊格内修斯在最后期限后交作业，老师就会降低他的期末考试成绩。现在我们假设每个人做作业都需要一天。所以伊格内修斯想让你帮他安排做作业的顺序，把降低的分数降到最低）
输入：
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.
（译文：输入包含几个测试用例。输入的第一行是单个整数T，这是测试用例的数量。接下来是T测试用例。
每个测试用例以一个正整数N(1<=N<=1000)开始，表示作业的数量。然后两行。第一行包含N个整数，表示主题的截止日期，下一行包含N个整数，表示降低的分数）
输出：
For each test case, you should output the smallest total reduced score, one line per test case.
（译文：对于每个测试用例，您应该输出最小的减少的总分，每个测试用例一行。）
样例：
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

题解：
对于这道题依然是关于贪心的思想，先按照分数排序，分数多的排在最前面，分数一样，截止日期小的排在前面。然后就是，可能之间有些天没有作业，可以在这些天里做。如下：

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct Node
{
    int date;
    int score;
}Hao[1007];
bool cmp(Node a,Node b)
{
//分数不同，大的排前面
    if(a.score!=b.score)
    {
        return a.score>b.score;
    }
   //相同，就日期小的排在前面
    else
    {
        return a.date<b.date;
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        int vis[1005];
        memset(vis,0,sizeof(vis));//这个就是数组全部置为0
        for(int i=0;i<n;i++)
        {
            scanf("%d",&Hao[i].date);
        }
        for(int i=0;i<n;i++)
        {
            scanf("%d",&Hao[i].score);
        }
        sort(Hao,Hao+n,cmp);
        int sum=0;
        for(int i=0;i<n;i++)
        {
            int j=Hao[i].date;
            for(;j>=1;j--)
            {
                if(!vis[j])
                {
                    vis[j]=1;
                    break;
                }
            }
             if(j==0)
                {
                    sum=sum+Hao[i].score;
                }
        }
        printf("%d\n",sum);
    }
    return 0;
}