#include<bits/stdc++.h>
#define int long long
using namespace std;

int n, m, m1, v[105], w[105], w1[105], dp[1005][1005], pre[1005][1005];

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> m1;
	for (int i = 1; i <= n; i++) cin >> v[i] >> w[i] >> w1[i];
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			for (int k = 1; k <= m1; k++) pre[j][k] = dp[j][k];
			for (int k = 1; k <= m1; k++){
				if (j >= w[i] && k >= w1[i]) dp[j][k] = max(pre[j][k], dp[j - w[i]][k - w1[i]] + v[i]);
				else dp[j][k] = pre[j][k];
			}
		}
	} 
	cout << dp[m][m1];
	return 0;
}

自己测试了多组数据，都可以过，但是就是不能$AC$，求大佬帮助