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

using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void fastio() {ios_base::sync_with_stdio(false);cin.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
    T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
    while (b) {
        T q = a/b; a %= b; swap(a, b);
        x0 -= q*x1; swap(x0, x1);
        y0 -= q*y1; swap(y0, y1);
    }
    x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}

bool cmp(const vll &lhs, const vll &rhs)
{
    return lhs.back() > rhs.back();
}

#define MX 300016
#define A ((ll)1e12)
#define INF (MX*A)

ll a[MX], si[MX], sd[MX], psps[MX];
vll ps[MX];
vll prel[MX], sufh[MX];

int main()
{
    fastio();

    int n, m, k;
    int nd = 0, ni = 0;
    ll ans = 0;

    cin >> n >> m >> k;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) cin >> a[j];
        if (is_sorted(a, a+m, greater<ll>())) {
            copy_n(a, m, sd+nd*m+1);
            ++nd;
            continue;
        }
        ps[ni].resize(m+1);
        ps[ni][0] = 0;
        partial_sum(a, a+m, ps[ni].be()+1);
        ++ni;
    }

    /// dec
    sort(sd+1, sd+1+nd*m, greater<ll>());
    //cerr << "dec ="; for (int i = 1; i <= nd*m; ++i) cerr << ' ' << sd[i]; cerr << '\n';
    partial_sum(sd+1, sd+1+nd*m, sd+1);
    //cerr << "sd = 0"; for (int i = 1; i <= nd*m; ++i) cerr << ' ' << sd[i]; cerr << '\n';

    /// inc
    sort(ps, ps+ni, cmp);
    prel[0].resize(m, INF);
    for (int i = 0; i < ni; ++i) {
        prel[i+1] = prel[i];
        for (int j = 1; j < m; ++j) prel[i+1][j] = min(prel[i+1][j], ps[i][m]-ps[i][j]);
        psps[i+1] = psps[i]+ps[i][m];
    }
    sufh[ni].resize(m, 0LL);
    for (int i = ni-1; i >= 0; --i) {
        sufh[i] = sufh[i+1];
        for (int j = 1; j < m; ++j) sufh[i][j] = max(sufh[i][j], ps[i][j]);
    }
    for (int j = 0; j < m; ++j) si[j] = sufh[0][j];
    for (int i = 1; i < ni; ++i) {
        si[i*m] = psps[i];
        for (int j = 1; j < m; ++j) si[i*m+j] = max(psps[i]+sufh[i][j], psps[i+1]-prel[i][j]);
    }
    si[ni*m] = psps[ni];
    //cerr << "si = 0"; for (int i = 1; i <= ni*m; ++i) cerr << ' ' << si[i]; cerr << '\n';

    for (int i = max(k-ni*m, 0); i <= min(k, nd*m); ++i) ans = max(ans, sd[i]+si[k-i]);
    cout << ans << '\n';

    return 0;
}