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
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

long long read() {
    long long x = 0; int c = getchar_unlocked();
    while (c < '0' || c > '9') c = getchar_unlocked();
    while('0' <= c && c <='9') {
        x = x * 10 + (c - '0');
        c = getchar_unlocked();
    }
    return x;
}

int main() {
    int n = read();
    int m = read();
    int k = read();

    vector<vector<long long>> v(n);
    vector<pair<long long, int>> incr;
    vector<int> isInc(n);
    vector<long long> sums(n);
    vector<vector<long long>> sufs(n);
    vector<vector<long long>> prefs(n);
    
    for (int i = 0; i < n; ++i) {
        v[i].resize(m);
        bool inc = false;
        long long last;
        last = read();
        v[i][0] = last;
        long long sum = last;
        prefs[i].resize(m);
        prefs[i][0] = sum;
        for (int j = 1; j < m; ++j) {
            v[i][j] = read();
            if (v[i][j] > last) inc = true;
            last = v[i][j];
            sum += v[i][j];
            prefs[i][j] = sum;
        }
        sums[i] = sum;

        sum = 0;
        sufs[i].resize(m);
        for (int j = m - 1; j >= 0; --j) {
            sum += v[i][j];
            sufs[i][j] = sum;
        }


        if (inc){
            incr.push_back({sum, i});
            isInc[i] = 1;
        }
    }

    int numInc = incr.size();
    sort(incr.begin(), incr.end());

    vector<long long> resInc(k + 1);
    long long sum = 0;
    for (int j = 0; j < numInc; ++j) {
        int taken = (j + 1) * m;
        if (taken > k) break;

        int ind = numInc - 1 - j;
        sum += incr[ind].first;
        resInc[taken] = sum;
    }

    if (numInc) {
        for (int r = 1; r < m; ++r) {
            if (r > k) break;
            vector<long long> sufMax(numInc);
            for (int j = 0; j < numInc; ++j) {
                sum = prefs[incr[j].second][r - 1];
                sufMax[j] = sum;
                if (j) sufMax[j] = max(sufMax[j], sufMax[j - 1]);
            }

            long long prefSum = 0;
            long long minTop = 1e18;
            int indMin = -1;
            resInc[r] = sufMax[numInc - 1];
            for (int j = 0; j < numInc; ++j) {
                sum = 0;
                int taken = (j + 1) * m;
                if ((taken + r) > k || (taken + r) > (numInc * m)) break;

                int ind = numInc - 1- j;
                int plateInd = incr[ind].second;

                prefSum += incr[ind].first;
                if (ind) sum = max(sum, prefSum + sufMax[ind - 1]);
                else sum = max(sum, prefSum);
                
                if (sufs[plateInd][r] < minTop) {
                    minTop = sufs[plateInd][r];
                    indMin = plateInd;
                }
                
                if (j < numInc) {
                    int nextPlate = incr[ind - 1].second;
                    if (sufs[nextPlate][r] < minTop) {
                        minTop = sufs[nextPlate][r];
                        indMin = nextPlate;
                    }
                    
                    long long newSum = prefSum + sums[incr[ind - 1].second] - sums[indMin] + prefs[indMin][r - 1];
                    sum = max(sum, newSum);
                    resInc[taken + r] = sum;
                }

            }
        }
    }

    vector<int> pointer(n);
    priority_queue<pair<long long, int>> decPQ;
    for (int i = 0; i < n; ++i) {
        if (!isInc[i]){
            decPQ.push({v[i][0], i});
        }
    }

    long long result = resInc[k];
    int nDec = 0;
    long long sumDec = 0;
    while (!decPQ.empty() && nDec < k) {
        int decInd = decPQ.top().second;
        long long decEl = decPQ.top().first;
        decPQ.pop(); 

        sumDec += decEl;
        ++nDec;

        result = max(result, resInc[k - nDec] + sumDec);

        ++pointer[decInd];
        if (pointer[decInd] < m) {
            decPQ.push({v[decInd][pointer[decInd]], decInd});
        }
    }

    printf("%lld\n", result);
}