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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<ll>> a;
  vector<ll> y;
  rep(i, 0, n) {
    vector<ll> v(m);
    rep(j, 0, m) cin >> v[j];
    if (is_sorted(all(v))) a.push_back(v);
    else y.insert(y.end(), all(v));
  }
  n = sz(a);
  vector<vector<ll>> b(n, vector<ll>(m + 1));
  rep(i, 0, n) rep(j, 0, m) b[i][j + 1] = b[i][j] + a[i][j];
  sort(all(b), [&](const auto& u, const auto& v) {
    return u[m] > v[m];
  });
  vector<ll> f(n * m + 1);
  rep(i, 0, n) f[(i + 1) * m] = f[i * m] + b[i][m];
  debug(f);
  rep(i, 1, m) {
    multiset<ll> lew, pra;
    rep(j, 0, n) pra.insert(b[j][i]);
    ll suma = 0;
    rep(j, 0, n) {
      if (sz(pra)) f[j * m + i] = max(f[j * m + i], suma + *prev(pra.end()));
      if (sz(lew)) f[j * m + i] = max(f[j * m + i], suma + *prev(lew.end()) + b[j][m]);
      suma += b[j][m];
      pra.erase(pra.find(b[j][i]));
      lew.insert(b[j][i] - b[j][m]);
    }
  }
  debug(f);
  sort(all(y), greater());
  vector<ll> z(sz(y) + 1);
  rep(i, 0, sz(y)) z[i + 1] = z[i] + y[i];
  debug(z);
  ll odp = 0;
  rep(i, 0, min(n * m, k) + 1) if (k - i <= sz(y)) odp = max(odp, f[i] + z[k - i]);
  cout << odp << '\n';
}