HDU 1789 Doing Homework again

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<limits.h>
using namespace std;
int t,n;
struct node{
    int a,b;
}s[1100];
int hash[1100];
int cmp(node l1,node l2)
{
    if(l1.b!=l2.b)
        return l1.b>l2.b;
    return l1.a>l2.a;
}
int main()
{
    int t,i,j;
    cin>>t;
    while(t--)
    {
        cin>>n;
        memset(hash,0,sizeof(hash));
        for(i=0;i<n;i++)
            cin>>s[i].a;
        for(i=0;i<n;i++)
            cin>>s[i].b;
        sort(s,s+n,cmp);
        int sum=0;
        for(i=0;i<n;i++)
        {
            for(j=s[i].a;j>0;j--)
            {
                if(!hash[j])
                {
                    hash[j]=1;
                    break;
                }
            }
            if(j==0)
              sum+=s[i].b;
        }
        cout<<sum<<endl;
    }
    return 0;
}