HDU 2191 简单01背包

1A

#include <iostream>
using namespace std;

const int  N = 105;
const int MAXW = 4005;
int v[N], w[N], num[N];
int dp[MAXW];

int max(int x, int y)
{
	if(x > y)
		return x;
	else
		return y;
}
int main()
{
	int t;
	cin >>t;
	while(t--)
	{
		int n , m;
		cin >> n >> m;
		for(int i = 0; i < m; i++)
			cin >> w[i] >> v[i] >> num[i];
		memset(dp, 0, sizeof(dp));
		for(int i = 0; i <  m; i++)
		{
			for(int j = 1; j <= num[i]; j++)
			{
				for(int k = n; k >= w[i]; k--)
				{
					dp[k] = max(dp[k], dp[k-w[i]] +v[i]);
				}
			}
		}
		cout << dp[n] << endl;
	}
	return 0;
}