hdu 1789 Doing Homework again

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1789

贪心  很不错的

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
struct  ss {
    int x,y;
}num[1005];
int flag[1005];
int cmp(ss s,ss t)
{
    if(s.y==t.y)return s.x<t.x;
    else return s.y>t.y;
    
}
int main()
{
    int i,j,k,n,ans;
    scanf("%d",&k);
    while (k--)
    {
        ans=0;
        scanf("%d",&n);
        for (i=1;i<=n;i++)
            scanf("%d",&num[i].x);
        for (i=1;i<=n;i++)
            scanf("%d",&num[i].y);
        sort(num+1,num+1+n,cmp);
        memset(flag,0,sizeof(flag));
        for (i=1;i<=n;i++)
        {
            for (j=num[i].x;j>=1;j--)
                if(!flag[j])
                {
                    flag[j]=1;
                    break;
                }
                if(j==0)ans+=num[i].y;
        }
        printf("%d\n",ans);
    }
    return 0;
}