版权声明:转载请附上地址 https://blog.csdn.net/weixin_44574520/article/details/89815338
luogu 1910
Code:
#include <bits/stdc++.h>
using namespace std;
#define maxn 110
#define maxm 1010
#define maxx 1010
int n,m,x,a[maxn],b[maxn],c[maxn];
int f[maxm][maxx];
inline void init_() {
freopen("a.txt","r",stdin);
}
inline int read_() {
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9') {
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9') {
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
inline void readda_() {
n=read_();m=read_();x=read_();
for(int i=1;i<=n;i++) {
a[i]=read_();b[i]=read_();c[i]=read_();
}
}
inline void work_() {
memset(f,0,sizeof(f));
for(int i=1;i<=n;i++) {
for(int j=m;j>=b[i];j--) {
for(int k=x;k>=c[i];k--) {
f[j][k]=max(f[j][k],f[j-b[i]][k-c[i]]+a[i]);
}
}
}
printf("%d",f[m][x]);
}
int main() {
init_();
readda_();
work_();
return 0;
}