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 i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

using u128 = unsigned __int128;
using i128 = __int128;

constexpr i64 inf = 1E18;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m, k;
    std::cin >> n >> m >> k;
    
    std::vector<std::vector<i64>> a;
    std::vector<i64> b;
    for (int i = 0; i < n; i++) {
        std::vector<i64> v(m);
        for (int j = 0; j < m; j++) {
            std::cin >> v[j];
        }
        
        if (std::is_sorted(v.begin(), v.end())) {
            a.push_back(v);
        } else {
            b.insert(b.end(), v.begin(), v.end());
        }
    }
    
    std::sort(b.begin(), b.end(), std::greater<> {});
    
    const int nb = b.size();
    std::vector<i64> sb(nb + 1);
    for (int i = 0; i < nb; i++) {
        sb[i + 1] = sb[i] + b[i];
    }
    
    n = a.size();
    std::vector<i64> sum(n);
    for (int i = 0; i < n; i++) {
        sum[i] = std::accumulate(a[i].begin(), a[i].end(), 0LL);
    }
    std::vector<int> p(n);
    std::iota(p.begin(), p.end(), 0);
    std::sort(p.begin(), p.end(),
        [&](int i, int j) {
            return sum[i] > sum[j];
        });
    std::vector<i64> sa(n + 1);
    for (int i = 0; i < n; i++) {
        sa[i + 1] = sa[i] + sum[p[i]];
    }
    
    i64 ans = 0;
    if (k <= nb) {
        ans = sb[k];
    }
    
    std::vector<i64> cur(n);
    
    for (int j = 1; j <= m; j++) {
        for (int i = 0; i < n; i++) {
            cur[i] += a[i][j - 1];
        }
        i64 f = 0, g = -inf;
        for (int i = 0; i < n; i++) {
            g = std::max(g + sum[p[i]], f + cur[p[i]]);
            f += sum[p[i]];
            
            if (i * m + j <= k && i * m + j + nb >= k) {
                ans = std::max(ans, g + sb[k - (i * m + j)]);
            }
        }
        
        f = 0;
        for (int i = n - 1; i >= 0; i--) {
            f = std::max(f, cur[p[i]]);
            
            if (i * m + j <= k && i * m + j + nb >= k) {
                ans = std::max(ans, f + sa[i] + sb[k - (i * m + j)]);
            }
        }
    }
    
    std::cout << ans << "\n";
    
    return 0;
}