HDU Doing Homework again

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

#define N 1005

struct node
{
	int d,s;
	bool operator < (const node a) const
	{
		if(d<a.d)
			return 1;
		return 0;
	}
}h[N];


bool cmp (node a,node b)
{
	if(a.s>b.s)
		return 1;
	else
		return 0;
}


int main()
{
	int t,n;
	int i,j,k,sum;
	int total,d[N];

	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=1;i<=n;i++)
			scanf("%d",&h[i].d);
		for(i=1;i<=n;i++)
			scanf("%d",&h[i].s);

		sort(h+1,h+1+n);
		total  = 0;
		h[0].s = 0;
		memset(d,0,sizeof(d));
		for(i = 1;i<=n;i++)
		{
			if(h[i].d!=d[total])
				d[++total]=h[i].d;
		}
		k=total;
		i=j=n;
		while(k)
		{
			while(h[i].d==d[k])
				i--;
			if(j-i<=d[k]-d[k-1])
			{
				j=i;
			}
			else
			{
				sort(h+i+1,h+j+1,cmp);
				j-=(d[k-d[k-1]]);
			}
			k--;
		}
		sum = 0;
		for(k=i;k<=j;k++)
			sum+=h[k].s;
		printf("%d\n",sum);
	}
	return 0;
}