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): 15450 Accepted Submission(s): 9013

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‘

题意：有n个作业，给出死线和超期罚分，求罚分最小值

做法：贪心，按分从小到大排序，遍历看在死线前能不能完成，

开始想错了，想成了按死线排序，死线小的在前面完成，可是分大的就可能要排到后面去了，可能会超期。
再次想用并查集 就是supermarket那题，结果也失败了gg，并不知道哪里错了
然后想想还是用普通的标记遍历吧。。。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#define maxn 100100
#define maxe 100010
typedef long long ll;
using namespace std;
const double eps=1e-5;
const int inf=0x3f3f3f3f3f;
struct Node
{
    int p;
    int ddl;
    bool done;
    int id;
    bool operator < (Node a)
    {
        if(ddl==a.ddl)return p>a.p;
        return ddl<a.ddl;
    }
}node[maxn],cp[maxn];
int pre[maxn];
int root(int x)
{
    if(pre[x]==x)return x;
    return pre[x]=root(pre[x]);
}
void join(int x,int y)
{
    int r1=root(x);
    int r2=root(y);
    if(r1==r2)return;
    if(r1<r2)pre[r2]=r1;
    else pre[r1]=r2;
}
bool cmp(Node a,Node b)
{
    if(a.p==b.p)return a.ddl>b.ddl;
    return a.p>b.p;
}
int used[maxn];
int main()
{
    int t;
    freopen("in.txt","r",stdin);
    scanf("%d",&t);
    int n;
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&node[i].ddl);
        for(int i=1;i<=n;i++)scanf("%d",&node[i].p);
        for(int i=1;i<=n;i++)node[i].done=false;
        for(int i=1;i<=n;i++)used[i]=0,pre[i]=i;
        sort(node+1,node+n+1,cmp);
        for(int i=0;i<n;i++)node[i].id=i;
//        memcpy(cp,node,sizeof(node));
//        sort(cp,cp+n)
        ll ans=0;
        int cur=0;
        pre[0]=0;
        int flag=0;
//        for(int i=1;i<=n;i++)
//        {
//            flag=0;
//            for(int j=node[i].ddl;j>=1;j--)
//            {
//                if(used[j]==0)
//                {
//                    flag=1;
//                    used[j]=1;
//                    break;
//                }
//
//            }
//            if(flag==0)ans+=node[i].p;
//        }
        for(int i=1;i<=n;i++)
        {
            int r=root(node[i].ddl);
            if(r==0){ans+=node[i].p;}//join(node[i].ddl,node[i].ddl+1);}
            else pre[r]=r-1;
        }
//        for(int i=1;i<=n;i++)
//            printf("%d %d\n",node[i].ddl,node[i].p);
//        cout<<endl;
//        for(int i=0;i<n;i++)
//            printf("%d %d\n",cp[i].ddl,cp[i].p);


//        for(int i=0;i<n;i++)
//        {
//            if(node[i].done)continue;
//            if(cur>=node[i].ddl)ans+=node[i].p;
//            node[i].done=true;
//            cur++;
//            for(int j=0;j<n;j++)
//            if(cp[j].id==i){cp[j].done=true;break;}
//            for(int j=0;j<n;j++)
//            {
//                if(cp[j].done)continue;
//                if(cur>=node[i].ddl)break;
//                cp[j].done=true;
//                node[cp[j].id].done=true;
//                cur++;
//            }
//            if(cur==n)break;
//        }

        printf("%lld\n",ans);
    }
    return 0;
}