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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int inf = 1e18;

struct SegTree{
    int size;
    vector<int> nodes;
    void setup(int _size){
        size = _size;
        nodes.assign(size * 2, inf);
    }
    void set_val(int pos, int val){
        pos += size;
        nodes[pos] = val;
        pos /= 2;
        while(pos){
            nodes[pos] = min(nodes[pos * 2], nodes[pos * 2 + 1]);
            pos /= 2;
        }
    }
    void prop(int pos){
        pos /= 2;
        while(pos){
            nodes[pos] = min(nodes[pos * 2], nodes[pos * 2 + 1]);
            pos /= 2;
        }
    }
    void update(int from, int to, int val){
        from += size; to += size;
        while(from <= to){
            int pot = 1, pos = from;
            while(from + pot * 2 <= to){
                if(pos % 2) break;
                pos /= 2;
                pot *= 2;
            }
            nodes[pos] += val;
            prop(pos);
            from += pot;
        }
    }
    int get_between(int from, int to){
        int result = nodes[from];
        from += size; to += size;
        while(from <= to){
            int pot = 1, pos = from;
            while(from + pot * 2 <= to){
                if(pos % 2) break;
                pos /= 2;
                pot *= 2;
            }
            result = min(result, nodes[pos]);
            from += pot;
        }
        return result;
    }
    int get_min(){
        // cout<<size<<" : size"<<endl;
        return nodes[1];
    }
};

signed main(){
    cin.tie(0)->sync_with_stdio(0);

    int n, m, k; cin>>n>>m>>k;
    vector<SegTree> sts(n);

    vector<vector<int>> values(n, vector<int>(m));
    vector<bool> skipping(n, 0);
    priority_queue<int> revs;
    vector<pair<int, int>> peaks;
    for(int i = 0; i<n; i++){
        int sum = 0;
        for(int j = 0; j<m; j++){
            cin>>values[i][j];
            sum += values[i][j];
        }
        if(values[i].front() < values[i].back()){
            peaks.push_back({sum, i});

        } else {
            skipping[i] = 1;
            for(int val : values[i]) revs.push(val);
        }
    }

    if(n == 1){
        int result = 0;
        for(int i = 0; i<k; i++) result += values[0][i];
        cout<<result<<endl;
        return 0;
    }

    vector<int> revs_presum(n * m + 10, 0);
    int cnt = 0;
    while(revs.size()){
        revs_presum[cnt + 1] = revs_presum[cnt] + revs.top();
        cnt++;
        revs.pop();
    }

    sort(peaks.rbegin(), peaks.rend());
    vector<int> presum_peaks = {0};
    for(auto [val, key] : peaks){
        presum_peaks.push_back(presum_peaks.back() + val);
    }

    sts.resize(m + 10);
    for(auto& st : sts) st.setup(peaks.size() + 10);

    for(int i = 0; i<peaks.size(); i++){
        int tsum = 0;
        for(int j = m - 1; j >= 0; j--){
            tsum += values[peaks[i].second][j];
            sts[j].set_val(i, tsum);
        }
    }

    // cout << sts[3].get_min() << endl;
    // cout << sts[3].get_between(0, 0) << endl;
    // exit(0);
    int result = revs_presum[k];
    // cout<<peaks[0].first<<" p0 "<<endl;
    for(int i = peaks.size() * m; i > 0; i--){
        // cout<<endl;
        // cout<<i<<" : i"<<endl;
        int peak_count = (i + m - 1) / m;

        int change = m - (peak_count * m - i);
        int tmp = presum_peaks[peak_count];
        // cout<<change<<" : change "<<peak_count<<" : peak count "<<tmp<<" : peaks presum"<<endl;
        if(change != m){
            if(peak_count < peaks.size()){
                int cpeak = presum_peaks[peak_count + 1] - presum_peaks[peak_count];
                int pre_peak = presum_peaks[peak_count] - presum_peaks[peak_count - 1];
                // cout<<cpeak<<" cpeak "<<pre_peak<<" pre peak"<<endl;
                // cout<<pre_peak - cpeak<<" : diff"<<endl;
                // cout<<"update from: "<<peak_count<<" to: "<<peaks.size()<<" on "<<change<<endl;
                sts[change].update(peak_count, peaks.size() + 1, pre_peak - cpeak);
            }

            int aa = sts[change].get_min();
            // cout<<aa<<" sts[change].get_min()"<<endl;
            tmp -= aa;
        }
        if(i > k) continue;
        // cout<<tmp<<" pre tmp "<<revs_presum[k - i]<<endl;
        tmp += revs_presum[k - i];
        // cout<<tmp<<" tmp"<<endl;
        result = max(result, tmp);
    }

    cout<<result<<endl;
}