1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define mp make_pair
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n , m , k;
    cin >> n >> m >> k;
    vector <vector <int> > dp(n + 1 , vector <int> (k + 1 , 0));
    vector <vector <int> > v(n + 1 , vector <int> (m + 1 , 0));
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> v[i][j];
            v[i][j] += v[i][j - 1];
        }
    }
    for(int i = 1; i <= m; i++)
    {
        if(i <= k)dp[1][i] = v[1][i];
    }
    for(int i = 2; i <= n; i++)
    {
        for(int j = 1; j <= k; j++)
        {
            dp[i][j] = dp[i - 1][j];
            for(int c = 1; c <= m; c++)
            {
                if(j - c > 0 && c <= k)
                {
                    dp[i][j] = max(dp[i][j] , dp[i - 1][j - c] + v[i][c]);
                }
                else if(j == c && c <= k)
                {
                    dp[i][j] = max(dp[i][j] , v[i][c]);
                }
            }
        }
    }
    cout << dp[n][k];
    return 0;
}