doing homework again(贪心).cpp

杭电acm解题报告2001---2099.

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

struct inf {
	int dd,cost;
	bool operator < (const inf &a) const {
		return cost > a.cost;
	}
}cs[1100];
int t,n;
bool day[1100];

int main()
{
	int i,j;
	scanf("%d",&t);
	while (t--) {
		scanf("%d",&n);
		for (i=0;i<n;i++) {
			scanf("%d",&cs[i].dd);
		}
		for (i=0;i<n;i++) {
			scanf("%d",&cs[i].cost);
		}
		sort(cs,cs+n);
		int sum = 0;
		memset(day,0,sizeof(day));
		for (i=0;i<n;i++) {
			for (j=cs[i].dd-1;j>=0;j--) {
				if (!day[j]) {
					break;
				}
			}
			if (j == -1) {
				sum += cs[i].cost;
			}
			else {
				day[j] = true;
			}
		}
		printf("%d\n",sum);
	}
}