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

#define int long long
typedef pair<int, int> T;
const int oo = 1e18;

void solve() {
    int n, m, K; cin >> n >> m >> K;
    vector<vector<int>>a;
    vector<int>drugie;
    drugie.emplace_back(0);
    for (int i = 1; i <= n; i++){
        vector<int>curr(m + 1);
        for (int j = 1; j <= m; j++) {
            cin >> curr[j];
        }
        if (curr.back() >= curr[1]) {
            for (int j = 1; j <= m; j++){
                curr[j] += curr[j - 1];
            }
            a.emplace_back(curr);
        } else {
            for (int j = 1; j <= m; j++) {
                drugie.emplace_back(curr[j]);
            }
        }
    }
    n = (int)a.size();
    vector<int>ord(n);
    iota(ord.begin(), ord.end(), 0);
    
    sort(drugie.begin() + 1, drugie.end(), [&](auto x, auto y){return x > y;});
    int D = (int)drugie.size();
    for (int i = 1; i < D; i++) drugie[i] += drugie[i - 1];
    vector<T>curr;
    vector<int>vis(n);
    int ans = drugie[min(K, D - 1)];
    for (int p = 0; p <= m; p++) {
        int s = 0;
        int j = 0;
        curr.clear();
        for (int i = 0; i < n; i++) curr.emplace_back(a[i][p], i);
        sort(curr.rbegin(), curr.rend());
        int ptr = 0;

        sort(ord.begin(), ord.end(), [&](auto x, auto y){
            return a[x].back() == a[y].back() ? a[x][p] > a[y][p] : a[x].back() > a[y].back();});
         
        int zostalo0 = K - p;
        if (zostalo0 >= 0 && !curr.empty()) {
            ans = max(ans, curr[0].first);
            if (zostalo0 < D) ans = max(ans, curr[0].first + drugie[zostalo0]);
        }
        int mn = oo;
        vis.assign(n, 0);
        for (auto i: ord) {
            vis[i] = 1;
            s += a[i].back();
            mn = min(mn, a[i].back() - a[i][p]);
            
            int zostalo = K - p - j * m;
            if (zostalo >= 0){
                ans = max(ans, s - mn);
                if (zostalo < D) {
                    ans = max(ans, s - mn + drugie[zostalo]);
                }
            } 
            j++;

            while (ptr < n && vis[curr[ptr].second]) ptr++;
            zostalo = K - p - j * m;
            if (zostalo >= 0 && ptr < n) {
                ans = max(ans, s + curr[ptr].first);
                if (zostalo < D) {
                    ans = max(ans, s + curr[ptr].first + drugie[zostalo]);
                }
            } 
        }
    }

    cout << ans << endl;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}