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
#include <algorithm>
#include <iostream>
#include <vector>

constexpr int64_t MAXN = 4e6;


int64_t revord_sum[MAXN];
int64_t ord_sum[MAXN];

int main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int64_t n,m,k;
    std::vector<std::vector<int64_t>> ord_seq, revord_seq;
    std::cin >> n >> m >> k;
    
    for (size_t i = 0; i < n; i++) {
        std::vector<int64_t> v;
        for (size_t j = 0; j < m; j++) {
            int64_t a_val;
            std::cin >> a_val;
            v.push_back(a_val);
        }
        bool decreasing = true;
        for (size_t j = 1; j < m; j++) {
            if (v[j - 1] < v[j]) {
                decreasing = false;
            }
        }
        if (decreasing) {
            revord_seq.push_back(v);
        } else {
            ord_seq.push_back(v);
        }
    }
    
    // handle revord
    std::vector<int64_t> all_revord;
    for (const auto &v : revord_seq) {
        for (const auto &e : v) {
            all_revord.push_back(0-e);
        }
    }
    std::ranges::sort(all_revord);
    for (size_t i = 0; i < all_revord.size(); i++) {
        revord_sum[i + 1] = revord_sum[i] - all_revord[i];
    }

    // handle ord
    std::vector<std::pair<int64_t, size_t>> total_sum_to_sort;
    for (size_t i = 0; i < ord_seq.size(); i++) {
        int64_t sm = 0;
        for (const auto e : ord_seq[i]) {
            sm += e;
        }
        total_sum_to_sort.emplace_back(0-sm, i);
    }
    std::ranges::sort(total_sum_to_sort);
    std::vector<std::vector<int64_t>> new_ord_seq;
    for (size_t i = 0; i < ord_seq.size(); i++) {
        new_ord_seq.push_back(ord_seq[total_sum_to_sort[i].second]);
    }
    ord_seq = new_ord_seq;
    // ord_seq is ordered

    std::vector<std::vector<int64_t>> prefix_sum;
    for (size_t i = 0; i < ord_seq.size(); i++) {
        std::vector<int64_t> v;
        v.push_back(0);
        for (size_t j = 0; j < ord_seq[i].size(); j++) {
            v.push_back(v[j] + ord_seq[i][j]);
        }
        prefix_sum.push_back(v);
    }

    int64_t k_with_last_one = 0;
    int64_t last_one = 0;

    std::vector<std::vector<int64_t>> max_add(n+1, std::vector<int64_t>(m+1,0));
    int64_t ord_seq_n = ord_seq.size();
    for (int i = ord_seq_n-1; i >= 0; i--) {
       for (int j = 0; j <= m; j++) {
           max_add[i][j] = std::max(max_add[i+1][j], prefix_sum[i][j]);
       }
    }

    std::vector<std::vector<int64_t>> min_substract(n, std::vector<int64_t>(m+1,0));
    for (int i = 0; i < ord_seq_n; i++) {
        for (int j = 0; j <= m; j++) {
            if (i == 0) {
                min_substract[i][j] = prefix_sum[i][m] - prefix_sum[i][j];
            } else {
                min_substract[i][j] = std::min(prefix_sum[i][m] - prefix_sum[i][j], min_substract[i-1][j]);
            }
        }
    }

    for (size_t kk = 0; kk < ord_seq.size() * m; kk++) {
        if (kk % m == 0) {
            last_one = prefix_sum[kk / m][m];
            k_with_last_one += last_one;
        }
        ord_sum[kk] = std::max(k_with_last_one - min_substract[kk / m][kk%m], k_with_last_one - last_one + max_add[kk / m][kk%m]);
    }
    ord_sum[ord_seq.size() * m] = k_with_last_one;
    int64_t result = 0;
    for (size_t kk = 0; kk <= k; kk++) {
        result = std::max(result, ord_sum[kk] + revord_sum[k-kk]);
    }
    std::cout << result << '\n';
}