DP分组背包WA求助

#include<iostream>
using namespace std;
int dp[15][205];
struct node1
{
	int w, c;
}; 
struct node
{
	int tot;
	node1 item[35];
}team[15];

int main()
{
	int v, n, t;
	cin >> v >> n >> t;
	for(int i = 1; i <= n; i++)
	{
		int x, y, z;
		cin >> x >> y >> z;
		team[z].item[++team[z].tot].w = x;
		team[z].item[team[z].tot].c = y;
	} 
	for(int i = 1; i <= t; i++)
	{
		for(int j = 0; j <= v; j++)
		{
			for(int k = 1; k <= team[i].tot; k++)
			{
				if(j >= team[i].item[k].w)
				{
					dp[i][j] = max(dp[i][j], dp[i-1][j-team[i].item[k].w] + team[i].item[k].c);
				}
				else dp[i][j] = max(dp[i][j], dp[i-1][j]);
			}
		}
	}
	cout << dp[t][v];
	return 0;
}