nyoj-49 开心的小明

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=49

代码：
#include<stdio.h>
#include<string.h>
#define max(a,b) a>b?a:b
int main(){
	int du[230],value[230],dp[120200];
	int total,num;
	int i,j,k,t,n;
	scanf("%d",&n);
	while(n--){
		memset(du,0,sizeof(du));
		memset(value,0,sizeof(value));
		memset(dp,0,sizeof(dp));
		scanf("%d%d",&total,&num);
		for(i=1;i<=num;i++)
		   scanf("%d %d",&value[i],&du[i]);
		for(i=1;i<=num;i++){
			for(j=total;j>=value[i];j--)
			   dp[j]=max(dp[j],dp[j-value[i]]+value[i]*du[i]);
		}
		printf("%d\n",dp[total]);
	}
	return 0;
}