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
#include <bits/stdc++.h>
#define pb push_back
#define st first
#define nd second

typedef long long ll;

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<ll>> a(n, vector<ll>(m, 0));

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
            if (j > 0) {
                a[i][j] += a[i][j-1];
            }
        }
    }

    vector<vector<ll>> dp(n+1, vector<ll>(k+1, 0));

    for (int i = 1; i <= n; ++i) { // n
        for (int j = 1; j <= k; ++j) { // k
            dp[i][j] = dp[i-1][j];
            for (int w = 1; w <= min(j, m); ++w) { // min(m,k)
                dp[i][j] = max(dp[i][j], dp[i-1][j-w] + a[i-1][w-1]);
            }
        }
    }

    cout << dp[n][k] << endl;
}