提交时间:2024-05-18 14:59:35

运行 ID: 147379

# include <bits/stdc++.h> using namespace std ; int t1 [110] , v1 [110] , g1 [110] , dp [1100] [110] ; int main() { int t , v , n ; cin >> t >> v >> n ; for ( int i = 1 ; i <= n ; i ++ ) { cin >> g1 [i] >> t1 [i] >> v1 [i] ; } for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = t ; j >= t1 [i] ; j -- ) { for ( int k = v ; k >= v1 [i] ; k -- ) { dp [j] [k] = max ( dp [j] [k] , dp [j - t1 [i]] [k - v1 [i]] + g1 [i] ) ; } } } cout << dp [t] [v] << endl ; return 0 ; }