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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>

int c;

void SKIP_WHITESPACE() {
    while (1) {
        c = fgetc(stdin);
        if (c != ' ' && c != '\n' && c != '\r')
            break;
    }
}

int READ_INT() {
    SKIP_WHITESPACE();
    int ret = c - '0';
    while (1) {
        c = fgetc(stdin);
        if (c < '0' || c > '9')
            break;
        ret = ret * 10 + c - '0';
    }
    return ret;
}

int64_t READ_INT64() {
    SKIP_WHITESPACE();
    int64_t ret = c - '0';
    while (1) {
        c = fgetc(stdin);
        if (c < '0' || c > '9')
            break;
        ret = ret * 10 + c - '0';
    }
    return ret;
}

#define KMAX 300000

int n, m, k, i, j, r, d;
int64_t row[KMAX];
bool asc;
int64_t dp[KMAX];
int64_t ap[KMAX];
int dpi, api;
int64_t sum, v;
int64_t ar[KMAX+1];
int64_t dr[KMAX+1];

struct vi {
    int64_t v;
    int idx;
};

struct compareVi {
    bool operator()(const vi& a, const vi& b) {
        return a.v < b.v;
    }
};

std::priority_queue<vi, std::vector<vi>, compareVi> pq;
int last[KMAX];
int napi;
int aidx[KMAX];

int64_t ssum[KMAX];
int64_t x, y;
int64_t apmax[KMAX];

int main(int argc, char* argv[]) {
    std::ios_base::sync_with_stdio (false);

    dpi = 0;

    n = READ_INT();
    m = READ_INT();
    k = READ_INT();

    for (i = 0; i < n; ++i) {
        asc = false;
        row[0] = READ_INT64();
        for (j = 1; j < m; ++j) {
            row[j] = READ_INT64();
            if (row[j] > row[j - 1]) {
                asc = true;
            }
        }

        if (asc) {
            sum = 0;
            for (j = 0; j < m; ++j) {
                sum += row[j];
                ap[api++] = sum;
            }
            aidx[napi] = napi;
            napi++;
        } else {
            for (j = 0; j < m; ++j) {
                dp[dpi++] = row[j];
            }
        }
    }

    for (i = 0; i < dpi / m; ++i) {
        pq.push({dp[i * m], i});
        last[i]++;
    }
    sum = 0;
    for (i = 0; i < dpi; ++i) {
        auto v = pq.top();

        sum += v.v;
        dr[i + 1] = sum;
        pq.pop();
        if (last[v.idx] < m) {
            pq.push({dp[v.idx * m + last[v.idx]], v.idx});
            last[v.idx]++;
        }
    }

    std::sort(aidx, aidx + napi, [](int a, int b) -> bool{
        return ap[a * m + m - 1] > ap[b * m + m - 1];
    });

    sum = 0;
    for (i = 0; i < napi; ++i) {
        sum += ap[aidx[i] * m + m - 1];
        ssum[i] = sum;
    }
    if (napi > 0) {
        for (j = 0; j < m; ++j) {
            apmax[aidx[napi - 1] * m + j] = ap[aidx[napi - 1] * m + j];
        }
        for (i = napi - 2; i >= 0; --i) {
            for (j = 0; j < m; ++j) {
                if (ap[aidx[i] * m + j] > apmax[aidx[i] * m + j]) {
                    apmax[aidx[i] * m + j] = ap[aidx[i] * m + j];
                }
            }
        }
    }

    for (j = 0; j < m; ++j) {
        ap[aidx[0] * m + j] -= ap[aidx[0] * m + m - 1];
    }
    for (i = 1; i < napi; ++i) {
        for (j = 0; j < m; ++j) {
            ap[aidx[i] * m + j] -= ap[aidx[i] * m + m - 1];
            if (ap[aidx[i-1] * m + j] > ap[aidx[i] * m + j]) {
                ap[aidx[i] * m + j] = ap[aidx[i-1] * m + j];
            }
        }
    }
    for (i = 1; i <= api ; ++i) {
        r = i % m;
        d = i / m;
        if (r == 0) {
            ar[i] = ssum[d - 1];
        } else {
            x = ssum[d] + ap[aidx[d] * m + r - 1];
            y = ((d > 0) ? ssum[d - 1] : 0) + ((d + 1 < napi) ? apmax[aidx[d + 1] * m + r - 1] : 0);
            ar[i] = ((x > y) ? x : y);
        }
    }

    sum = 0;
    for (i = 0; i <= k; ++i) {
        v = dr[i] + ar[k - i];
        if (v > sum) {
            sum = v;
        }
    }
    std::cout << sum << "\n";
    return EXIT_SUCCESS;
}