30分

提交结果

#include<bits/stdc++.h>
using namespace std;
long long A,B,n,a[51],b[51],c[51],d[51][401][401],x;
int main(){
	cin >> A >> B >> n;
	for (int i=1;i<=n;i++){
		cin >> a[i] >> b[i] >> c[i];
	}
	for (int i=1;i<=n;i++){
		for (int j=A;j>=a[i];j--){
			for (int k=B;k>=b[i];k--){
				d[i][j][k]=max(d[i-1][j][k],d[i-1][j-a[i]][k-b[i]]+c[i]);
				x=max(x,d[i][j][k]);
			}
		}
	}
	cout << x;
}

感谢