神秘错误50pts求条

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int N = 110;
ll tf[N][N];
ll df[N][N];
ll n,m,r;
ll rmb[N],rp[N],ti[N];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> n;
	for(int i = 1;i <= n;i ++){
		cin >> rmb[i] >> rp[i] >> ti[i];
	}
	cin >> m >> r;
	df[0][0] = 0;
	tf[0][0] = 0; 
	for(int i = 1;i <= n;i ++){
		for(int j = m;j >= rmb[i];j --){
			for(int k = r;k >= rp[i];k --){
				if(df[j][k] == df[j - rmb[i]][k - rp[i]]){
					tf[j][k] = min(tf[j][k],tf[j - rmb[i]][k - rp[i]] + ti[i]);
				}
				if(df[j][k] < df[j - rmb[i]][k - rp[i]] + 1){
					df[j][k] = df[j - rmb[i]][k - rp[i]] + 1;
					tf[j][k] = tf[j - rmb[i]][k - rp[i]] + ti[i];
				}
			}
		}
	}
	cout << tf[m][r] << endl;
	return 0;
}