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
48
49
50
51
52
53
54
#include <bits/stdc++.h>
using namespace std;
vector<long long > s[300004];
vector<long long > wyn[300004];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    long long n, k, m, a;
    int i, j, z;
    cin >> n >> m >> k;
    wyn[0].resize(k+1);
    for(j = 1; j <= k; j++) wyn[0][j] = -1;
    for(j = 1; j <= n; j++) {
        s[j].push_back(0);
        wyn[j].resize(k+1);
        for(i = 1; i <= m; i++){
            cin >> a;
            s[j].push_back(s[j][i-1]+ a);
        }
    }
    /*
    for(j = 1; j <= n;j++){
        for(i = 0; i <= m; i++)cout << s[j][i] << " ";
        cout << endl;
    }
    for(j = 0; j <= n;j++){
        for(i = 0; i <= k; i++)cout << wyn[j][i] << " ";
        cout << endl;
    } */
    for(j = 1; j <= n; j++){
        for(i = 1; i <= m; i++){
            int waga = i;
            long long cena = s[j][i];
            for(z = waga; z <= k; z++){
              if(wyn[j-1][z - waga] >= 0)
                if (wyn[j-1][z - waga]+ cena > wyn[j-1][z] && wyn[j-1][z - waga]+ cena > wyn[j][z]  ){
                    wyn[j][z] = wyn[j-1][z-waga] + cena;
                }
                else{
                    if (i == 1) wyn[j][z] = wyn[j-1][z];
                }
            }
        }
    }
    /*for(j = 1; j <= n;j++){
        for(i = 1; i <= k; i++)cout << wyn[j][i] << " ";
        cout << endl;
    }
    */
    cout << wyn[n][k];

  return 0;
}