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

#define ll long long
#define st first
#define nd second
#define ld long double

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n, m, k;
    cin >> n >> m >> k;
    vector<vector<ll>> a (n, vector<ll> (m, 0)), p (n, vector<ll> (m, 0));
    vector<ll> s (n, 0);
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < m; j++) {
            cin >> a[i][j];
            s[i] += a[i][j];
            p[i][j] = s[i];
        }
    }
    vector<ll> c;
    vector<pair<ll, ll>> w;
    for (ll i = 0; i < n; i++) {
        if (a[i][0] >= a[i][m-1]) {
            for (ll j : a[i]) {
                c.push_back(j);
            }
        }
        else {
            w.push_back({s[i], i});
        }
    }
    sort(c.rbegin(), c.rend());
    sort(w.rbegin(), w.rend());
    ll l = w.size();
    vector<ll> spc (c.size()+1);
    for (ll i = 0; i < c.size(); i++) {
        spc[i+1] = spc[i]+c[i];
        //cout << spc[i] << ' ';
    }
    if (l==0) {
        cout << spc[k] << '\n';
        return 0;
    }
    //cout << '\n';
    vector<vector<ll>> mp (l, vector<ll> (m, 1e18)), ms (l, vector<ll> (m, -1e18));
    for (ll i = 0; i < m; i++) {
        mp[0][i] = s[w[0].nd]-p[w[0].nd][i];
        ms[l-1][i] = p[w[l-1].nd][i];
        //cout << 0 << ' ' << i << ' ' << mp[0][i] << ' ' << ms[l-1][i] << '\n';
    }
    for (ll i = 1; i < l; i++) {
        for (ll j = 0; j < m; j++) {
            mp[i][j] = min(mp[i-1][j], s[w[i].nd]-p[w[i].nd][j]);
            ms[l-i-1][j] = max(ms[l-i][j], p[w[l-i-1].nd][j]);
            //cout << i << ' ' << j << ' ' << mp[i][j] << ' ' << ms[l-i-1][j] << '\n';
        }
    }
    vector<ll> sps (l+1, 0);
    for (ll i = 0; i < l; i++) {
        sps[i+1] = sps[i]+s[w[i].nd];
        //cout << sps[i+1] << ' ';
    }
    //cout << '\n';
    ll ans = 0;
    for (ll i = max(0ll, (ll)k-(ll)c.size()); i <= min(k, l*m); i++) {
        //cout << i << ' ' << ans << '\n';
        ll d = i/m, r = i%m;
        if (r==0) {
            ans = max(ans, sps[d]+spc[k-i]);
            continue;
        }
        //cout << sps[d+1] << ' ' << mp[d][r-1] << ' ' << spc[k-i] << '\n';
        ans = max(ans, sps[d+1]-mp[d][r-1]+spc[k-i]);
        //cout << sps[d] << ' ' << ms[d][r-1] << ' ' << spc[k-i] << '\n';
        ans = max(ans, sps[d]+ms[d][r-1]+spc[k-i]);
    }
    cout << ans << '\n';
}