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
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<long long>> prefix(n, vector<long long>(m + 1, 0));
    for (int i = 0; i < n; i++)
        for (int j = 1; j <= m; j++) {
            cin >> prefix[i][j];
            prefix[i][j] += prefix[i][j-1];
        }

    vector<long long> dp(k + 1, -INF);
    dp[0] = 0;

    for (int i = 0; i < n; i++) {
        vector<long long> ndp(k + 1, -INF);
        for (int t = 0; t <= k; t++) {
            if (dp[t] == -INF) continue;
            for (int j = 0; j <= m && t + j <= k; j++)
                ndp[t + j] = max(ndp[t + j], dp[t] + prefix[i][j]);
        }
        dp = ndp;
    }

    cout << dp[k] << "\n";
    
    return 0;
}