题解

#include <bits/stdc++.h>
using namespace std;
const int maxn = 101;
const int maxm = 10001;
int p[maxn][maxm], f[maxm];
int main()
{
    int n,m,t;
	cin >> t >> n >> m;
	for(int i = 1; i <= t; i++)
		for(int j = 1; j <= n; j++)
			cin >> p[j][i];
	for(int k = 1; k < t; k++)
	{
		memset(f, 0, sizeof(f));
		for(int i = 1; i <= n; i++)
			for(int j = p[i][k]; j <= m; j++)
				f[j] = max(f[j], f[j - p[i][k]] + p[i][k + 1] - p[i][k]);
      
		m += f[m];
	}
	cout << m;
	return 0;
}