题解

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int a[10005];
int w[105][105];
int main() {
int T,N,M;
cin>>T>>N>>M;
for (int i=1;i<=T;i++) {
for (int j=1;j<=N;j++) {
cin>>w[i][j];
}
}
for (int t=1;t<=T;t++) {
memset(a,0,sizeof(a));
for (int i=1;i<=N;i++) {
for (int j=w[t][i];j<=M;j++) {
a[j]=max(a[j],a[j-w[t][i]]+(w[t+1][i]-w[t][i]));
}
}
M+=a[M];
}
cout<<M;
return 0;
}