@[WSEDSWZD](/space/show?uid=66141)
```
#include<iostream>
#include<algorithm>
using namespace std;
int n,tijia,zhilianga,tiji[51],zhiliang[51],kaluli[51],f[51][401][401];
int main()
{
cin>>tijia>>zhilianga>>n;
for(int i=1;i<=n;i++)
{
cin>>tiji[i]>>zhiliang[i]>>kaluli[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=tijia;j++)
{
for(int k=1;k<=zhilianga;k++)
{
f[i][j][k]=f[i-1][j][k];
if(j>=tiji[i]&&k>=zhiliang[i])
f[i][j][k]=max(f[i][j][k],f[i-1][j-tiji[i]][k-zhiliang[i]]+kaluli[i]);
}
}
}
cout<<f[n][tijia][zhilianga];
return 0;
}
```
by Xxzxx @ 2018-06-19 21:12:39
# [此贴终结](https://www.luogu.org/discuss/show?postid=46001)
by Xxzxx @ 2018-06-22 19:16:42