题解 | 【模板】二维费用背包

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=60,M=600;

int n,t[N],h[N],a[N],T,H; 
int dp[N][M][M];

void solve(){
	
	for(int i=1;i<=n;i++){
		for(int j=0;j<=T;j++){
			for(int k=0;k<=H;k++){
				dp[i][j][k]=dp[i-1][j][k];
				if(j>=t[i]&&k>=h[i]){
					dp[i][j][k]=max(dp[i][j][k],dp[i-1][j-t[i]][k-h[i]]+a[i]);
				}
			}
		}
	}
	cout<<dp[n][T][H]<<endl;
	
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>n;
	cin>>T>>H;
	for(int i=1;i<=n;i++){
		cin>>t[i]>>h[i]>>a[i];
	}
	solve();
    return 0;
}