20pts求调！！

#include <iostream>
using namespace std;

const int maxW = 405;
const int maxV = 405;
const int N = 55;

int varr[N];
int warr[N];
int val[N];
int dp[N][maxW][maxV];

int main(int argc, char **argv)
{
	int w, v, n;
	cin >> w >> v >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> varr[i] >> warr[i] >> val[i];
	}
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= w; j++)
		{
			for(int k = 1; k <= v; k++)
			{
				if(j < warr[i] || k < varr[i])
				{
					dp[i][j][k] = dp[i - 1][j][k];
					continue;
				}
				dp[i][j][k] = max(dp[i - 1][j][k], dp[i - 1][j - warr[i]][k - varr[i]] + val[i]);
			}
		}
	}
	cout << dp[n][w][v] << endl;
	return 0;
}