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

typedef long long ll;
const ll INF = (ll)1e18 + 10;
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	int n, m, k;
	cin >> n >> m >> k;

	vector<ll> f;
	vector<vector<ll>> v;
	for (int i = 0; i < n; i++) {
		vector<ll> a(m);
		for (int j = 0; j < m; j++) {
			cin >> a[j];
		}
		bool flag = true;
		for (int j = 1; j < m; j++) {
			if (a[j - 1] < a[j]) flag = false;
		}
		if (flag) {
			f.insert(f.end(), a.begin(), a.end());
		}
		else {
			for (int j = 1; j < m; j++) a[j] += a[j - 1];
			v.push_back(a);
		}
	}
	sort(v.begin(), v.end(), [&](auto &i, auto &j) {
		return i[m - 1] > j[m - 1];
	});
	sort(f.begin(), f.end(), [&](int i, int j) {
		return i > j;
	});
	for (int i = 1; i < f.size(); i++) f[i] += f[i - 1];

	int sz = v.size();
	vector<vector<ll>> best_p(m, vector<ll>(sz + 1, -INF));
	vector<vector<ll>> best_s(m, vector<ll>(sz + 1, -INF));
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < sz; j++) {
			best_p[i][j + 1] = max(best_p[i][j], v[j][i] - v[j][m - 1]);
		}
		for (int j = sz - 1; j >= 0; j--) {
			best_s[i][j] = max(best_s[i][j + 1], v[j][i]);
		}
	}
	ll ans = 0;
	for (int i = 0; i <= min(k, (int)f.size()); i++) {
		if (k - i > m * v.size()) continue;
		ll sum = 0;
		for (int j = 0; j < (k - i) / m; j++) {
			sum += v[j][m - 1];
		}
		int r = (k - i) % m;
		if (r > 0) {
			if (sz <= (k - i) / m) continue;
			ll mx = 0;
			mx = max(mx, sum + best_p[r - 1][(k - i) / m] + v[(k - i) / m][m - 1]);
			mx = max(mx, sum + best_s[r - 1][(k - i) / m]);
			sum = mx;
		}
		ans = max(ans, (i == 0 ? 0 : f[i - 1]) + sum);
	}
	cout << ans << '\n';
}