HDU - 1789 - Doing Homework again

Doing Homework again

---

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

---

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

---

题目大意：有n个作业，每个作业有各自的截止时间以及不完成要扣除的分数。每天只能做一个作业，求最少被扣除多少分。

---

贪心思路，先做扣分多的，要记录做过作业的每一天。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
    int deadline,score;
}a[1010];
bool cmp(node a,node b)
{
    return a.score>b.score;
}
int t,n,vis[1010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof a);
        memset(vis,0,sizeof vis);
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i].deadline);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i].score);
        sort(a,a+n,cmp);
        int i, j, ans = 0;
        for(i=0;i<n;i++)
        {
            if(vis[a[i].deadline])//这天已经做过作业的话就往前找，找到没做过作业的一天
            {
                for(j = a[i].deadline ;j>0;j--)
                {
                    if(vis[j])
                        continue;
                    vis[j] = 1;
                    break;
                }
                if(j == 0)
                    ans += a[i].score;//没有多余的时间写
            }
            else
                vis[a[i].deadline] = 1;//将用过的标记
        }
        cout<<ans<<endl;
    }
    return 0;
}