【解题报告】【HDOJ1789】【贪心算法】Doing Homework again

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

#include<stdio.h>
struct node{
    int x,y;
};
int main()
{
    struct node a[1001];
    int record[1001],flag,sum,i,j,t1,n,T,t2;
    //freopen("1.txt","r",stdin);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        sum=0;
        for(i=1;i<=n;i++){ scanf("%d",&a[i].x); record[i]=0;}
        for(i=1;i<=n;i++) scanf("%d",&a[i].y);
        for(i=1;i<=n;i++)
        {
            for(j=i;j<=n;j++)
                if(a[j].y>a[i].y)
                {
                    t1=a[i].y;
                    t2=a[i].x;
                    a[i].y=a[j].y;
                    a[i].x=a[j].x;
                    a[j].y=t1;
                    a[j].x=t2;
                }
        }
        //for(i=1;i<=n;i++) printf("<%d>",a[i].x);
        for(i=1;i<=n;i++)
        {
            flag=1;
            for(j=a[i].x;j>0;j--)
            {
                if(record[j]==0)
                {
                    record[j]=1;
                    flag=0;
                    break;
                }
            }
            if(flag) sum+=a[i].y;
        }
        printf("%d\n",sum);
    }
    return 0;
}