hdu1789 Doing Homework again(贪心+排序)

Doing Homework again

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

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<bits/stdc++.h>
using namespace std;
struct node
{
    int day,score;
    int flag;
} a[1005];
bool cmp(node x,node y)
{
    if(x.day==y.day)
    {
        return x.score>y.score;
    }
    else
    {
        return x.day<y.day;
    }
}
void init()
{
    for(int i=0; i<1005; i++)
    {
        a[i].day=0;
        a[i].score=0;a[i].flag=1;
    }
}
int main()
{
    int t;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            int n;
            scanf("%d",&n);
            init();
            for(int i=0;i<n;i++)
            {
                scanf("%d",&a[i].day);
            }
            for(int i=0;i<n;i++)
            {
                scanf("%d",&a[i].score);
            }
            sort(a,a+n,cmp);
            int temp=1,ans=0;
            for(int i=0;i<n;i++)
            {
                if(a[i].day>=temp)
                {
                    temp++;
                    continue; 
                }
                int p=a[i].score,pos=i;
                for(int j=0;j<i;j++)
                {
                    if(a[j].score<p&&a[j].flag)//前面有耗时少的,而且没有扣过分 
                    {
                        p=a[j].score;
                        pos=j;
                    }
                }
                ans+=p;
                a[pos].flag=0;//扣分标记 
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}