救救孩子！

#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
int wei[N], wor[N], tot[N], dp[1005], group[N][N], v, n, t, x;
int main()
{
	cin >> v >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> wei[i] >> wor[i] >> x;
		tot[x]++;
		group[x][tot[x]] = i;
		t = x;
	}
	for(int i = 1;i <= t;i++)	for(int j = v;j >= 0;j--)
	for(int k = 1;k <= group[i][tot[i]];k++){
	int id = group[i][k];
		if(j >= wei[id])
	dp[j] = max(dp[j], dp[j-wei[id]] + wor[id]);
	}
	cout << dp[v];
	return 0;
}