1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll n, m, k;
    cin >> n >> m >> k;
    vector<ll> vals;
    for (int i = 0; i < n; i++) {
        vector<ll> a(m);
        for (int j = 0; j < m; j++) cin >> a[j];
        if (a[0] < a[m-1]) reverse(a.begin(), a.end());
        for (int j = 0; j < m; j++) {
            vals.push_back(a[j]);
        }
    }
    sort(vals.rbegin(), vals.rend());
    ll res = 0;
    for (int i = 0; i < k; i++) res += vals[i];
    cout << res;
}