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
#define _CRT_SECURE_NO_WARNINGS

#include<cstdio>
#include<algorithm>
#include<vector>
#include<climits>

using namespace std;

constexpr auto K = 300005;

long long sumy_dla_malejacych[K];
vector<vector<long long>> wiersze_rosnace;

struct StosNalesnikow {
    long long suma;
    vector<long long> suma_poczatkowa;
};

vector<long long> solve(vector<vector<long long>>& stosy_nalesnikow, int n, int m) {
    int ile_wszystkich = n * m;

    vector<StosNalesnikow> wzbogacone_stosy_nalesnikow(n);
    for (int i = 0; i < n; ++i) {
        wzbogacone_stosy_nalesnikow[i].suma_poczatkowa.assign(m + 1, 0);
        for (int j = 0; j < m; ++j) {
            wzbogacone_stosy_nalesnikow[i].suma_poczatkowa[j + 1] = wzbogacone_stosy_nalesnikow[i].suma_poczatkowa[j] + stosy_nalesnikow[i][j];
        }
        wzbogacone_stosy_nalesnikow[i].suma = wzbogacone_stosy_nalesnikow[i].suma_poczatkowa[m];
    }

    sort(begin(wzbogacone_stosy_nalesnikow), end(wzbogacone_stosy_nalesnikow),
        [](const StosNalesnikow& a, const StosNalesnikow& b) {
            return a.suma > b.suma;
        }
    );

    vector<long long> sumy_w_pionie(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        sumy_w_pionie[i + 1] = sumy_w_pionie[i] + wzbogacone_stosy_nalesnikow[i].suma;
    }

    long long MIN_INF = LLONG_MIN;
    vector<long long> result(ile_wszystkich + 1, MIN_INF);
    result[0] = 0;

    for (int i = 1; i <= n; i++) {
        result[i * m] = sumy_w_pionie[i];
    }

    for (int p = 1; p < m; p++) {
        vector<long long> max_left(n + 1, MIN_INF);
        vector<long long> max_right(n + 1, MIN_INF);

        long long current_max_left = MIN_INF;
        for (int i = 1; i <= n; i++) {
            long long P_i_p = wzbogacone_stosy_nalesnikow[i - 1].suma_poczatkowa[p];
            long long S_i = wzbogacone_stosy_nalesnikow[i - 1].suma;
            current_max_left = max(current_max_left, P_i_p - S_i);
            max_left[i] = current_max_left;
        }

        long long current_max_right = MIN_INF;
        for (int i = n - 1; i >= 0; i--) {
            long long P_i_p = wzbogacone_stosy_nalesnikow[i].suma_poczatkowa[p];
            current_max_right = max(current_max_right, P_i_p);
            max_right[i] = current_max_right;
        }

        for (int i = 0; i < n; i++) {
            int k = i * m + p;
            long long best = MIN_INF;
            
            if (i >= 1) {
                best = max(best, sumy_w_pionie[i + 1] + max_left[i]);
            }

            if (i < n) {
                best = max(best, sumy_w_pionie[i] + max_right[i]);
            }

            result[k] = max(result[k], best);
        }
    }

    return result;
}

int main() {
    int n, m, k;
    scanf("%d %d %d", &n, &m, &k);

    vector<long long> elementy_malejace;
    
    for (int i = 0; i < n; i++) {
        vector<long long> wiersz = vector<long long>(m);
        for (int j = 0; j < m; j++) {
            scanf("%lld", &wiersz[j]);
        }
        bool malejacy = true;
        for (int j = 1; j < m; j++) {
            if (wiersz[j] > wiersz[j - 1]) {
                malejacy = false;
                break;
            }
        }
        if (malejacy) {
            elementy_malejace.insert(end(elementy_malejace), begin(wiersz), end(wiersz));
        }
        else {
            wiersze_rosnace.push_back(wiersz);
        }
    }

    sort(begin(elementy_malejace), end(elementy_malejace), greater<long long>());
    int s = elementy_malejace.size();
    for (int i = 0; i < s; i++) {
        sumy_dla_malejacych[i + 1] = sumy_dla_malejacych[i] + elementy_malejace[i];
    }

    int ile_wierszy_rosnacych = wiersze_rosnace.size();
    vector<long long> wynik_dla_rosnacych;
    if (ile_wierszy_rosnacych > 0) {
        wynik_dla_rosnacych = solve(wiersze_rosnace, ile_wierszy_rosnacych, m);
    }
    int ile_rosnacych = wynik_dla_rosnacych.size();

    long long result = 0;
    long long ile_malejacych = min(s, k);
    for (int i = 0; i <= ile_malejacych; i++) {

        long long new_result = 0;
        if (k - i < ile_rosnacych) {
            new_result = sumy_dla_malejacych[i] + wynik_dla_rosnacych[k - i];
        }
        else {
            new_result = sumy_dla_malejacych[i];
        }

        if (new_result > result) {
            result = new_result;
        }
    }

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