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

using namespace std;

constexpr int MAX_N = 3e5, MAX_M = 3e5, MAX_K = 3e5;

int n, m, k;
long long a, inc[MAX_K + 1], desc[MAX_K + 1], ans;
bool used[MAX_N + 1];
vector<vector<long long>> rev_desc;
set<pair<long long, int>> prefixes[MAX_M + 1], griddy;
vector<long long> suffixes[MAX_N + 1];
long long min_used_suffix[MAX_M + 2];

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

    cin >> n >> m >> k;

    for (int i = 1; i <= m; ++i) {
        min_used_suffix[i] = LLONG_MAX;
    }

    for (int i = 1; i <= n; ++i) {
        vector<long long> vec;
        
        for (int j = 1; j <= m; ++j) {
            cin >> a;
            vec.push_back(a);
        }

        if (is_sorted(vec.begin(), vec.end())) {
            long long pref = 0;

            for (int j = 1; j <= m; ++j) {
                pref += vec[j - 1];
                prefixes[j].insert({-pref, i});
            }

            suffixes[i] = vector<long long>(m + 2, 0);

            for (int j = m; j >= 1; --j) {
                suffixes[i][j] = suffixes[i][j + 1] + vec[j - 1];
            }
        }
        else {
            reverse(vec.begin(), vec.end());
            rev_desc.push_back(vec);
        }
    }

    int sum_already = 0;

    while (true) {
        bool brk = true;

        for (int i = 1; i <= m && !prefixes[i].empty() && (sum_already + i) <= k; ++i) {
            auto it = prefixes[i].begin();

            while (!prefixes[i].empty() && used[it->second]) {
                it = prefixes[i].erase(it);
            }

            if (prefixes[i].empty()) {
                break;
            }

            inc[sum_already + i] = inc[sum_already] - it->first + max(
                0LL, min_used_suffix[i + 1] != LLONG_MAX ? (suffixes[it->second][i + 1] - min_used_suffix[i + 1]) : 0
            );

            if (i == m) {
                sum_already += m;
                used[it->second] = true;
                for (int j = 1; j <= m; ++j) {
                    min_used_suffix[j] = min(min_used_suffix[j], suffixes[it->second][j]);
                }
                brk = false;
            }
        }

        if (brk) {
            break;
        }
    }

    for (int i = 0; i < (int)rev_desc.size(); ++i) {
        griddy.insert({-rev_desc[i].back(), i});
    }

    for (int i = 1; i <= k && !griddy.empty(); ++i) {
        auto it = griddy.begin();
        
        desc[i] = desc[i - 1] - it->first;
        
        int idx = it->second;
        
        rev_desc[idx].pop_back();
        griddy.erase(it);

        if (!rev_desc[idx].empty()) {
            griddy.insert({-rev_desc[idx].back(), idx});
        }
    }

    for (int i = 0; i <= k; ++i) {
        ans = max(ans, inc[i] + desc[k - i]);
    }

    cout << ans << '\n';
}