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
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

int n, m;
long long a;
const int maxN = 300000;
vector<vector<long long>> stosy;
vector<int> stosy_lejek;
vector<int> stosy_piramida;
vector<long long> lejki_sumy;
vector<pair<long long, int>> stos_piramid_sumy;
vector<vector<long long>> min_stos;
vector<vector<long long>> max_top_stos;
vector<vector<long long>> stos_sumy_partial;
vector<long long> partial_sum;

long long piramidy_suma(int k) {
	if (k == 0) return 0;
	int full = (k - 1) / m;
	int rem =  ((n*m -  k) % m);
	
	return max(
		partial_sum[full + 1] - min_stos[full][rem], 
		partial_sum[full] + max_top_stos[full+1][rem]);
}
int placki;

int main()
{
	cin >> n >> m >> placki;
	stosy = vector<vector<long long>>();
	for (int i = 0; i < n; i++) {
		stosy.push_back(vector<long long>());
		for (int j = 0; j < m; j++) {
			cin >> a;
			stosy[i].push_back(a);

		}

		bool is_piramida = false;
		if (m > 1) {
			for (int k = 1; k < m; k++) {
				if (stosy[i][k - 1] < stosy[i][k]) {
					is_piramida = true;
					break;
				}
				if (stosy[i][k - 1] > stosy[i][k]) {
					break;
				}
			}
		}
		if (is_piramida) stosy_piramida.push_back(i);
		else stosy_lejek.push_back(i);
	}
	lejki_sumy = vector<long long>();
	for (auto stos : stosy_lejek) {
		for (auto val : stosy[stos]) {
			lejki_sumy.push_back(-val);
		}
	}
	sort(lejki_sumy.begin(), lejki_sumy.end());
	if (stosy_lejek.size() > 0) {
		lejki_sumy[0] = -lejki_sumy[0];
		for (int i = 1; i < lejki_sumy.size(); i++) {
			lejki_sumy[i] = lejki_sumy[i - 1] + (-lejki_sumy[i]);
		}
	}

	stos_piramid_sumy = vector<pair<long long, int>>();
	for (auto stos : stosy_piramida) {
		long long sum_stos = 0;
		for (auto val : stosy[stos]) {
			sum_stos += val;
		}
		stos_piramid_sumy.push_back({ -sum_stos, stos });
	}
	sort(stos_piramid_sumy.begin(), stos_piramid_sumy.end());

	min_stos = vector<vector<long long>>();
	stos_sumy_partial = vector<vector<long long>>();
	max_top_stos = vector<vector<long long>>();
	for (int i = 0; i < stosy_piramida.size()+1; i++) {
		min_stos.push_back(vector<long long>());
		stos_sumy_partial.push_back(vector<long long>());
		max_top_stos.push_back(vector<long long>());
		for (int j = 0; j < m + 1; j++) {
			min_stos[i].push_back(0);
			stos_sumy_partial[i].push_back(0);
			max_top_stos[i].push_back(0);
		}
	}

	for (int i = 0; i < stosy_piramida.size(); i++) {
		int stos = stos_piramid_sumy[i].second;
		for (int j = 1; j <= m; j++) {
			stos_sumy_partial[i][j] = stos_sumy_partial[i][j - 1] + stosy[stos][m - j];
		}
	}
	if (stosy_piramida.size() > 0) {
		for (int i = 1; i <= m; i++) {
			min_stos[0][i] = stos_sumy_partial[0][i];
			for (int j = 1; j < stosy_piramida.size(); j++) {
				min_stos[j][i] = min(min_stos[j - 1][i], stos_sumy_partial[j][i]);
			}
		}
	}
	partial_sum = vector<long long>();
	partial_sum.push_back(0);
	for (int i = 0; i < stosy_piramida.size(); i++) {
		partial_sum.push_back(partial_sum[i] - stos_piramid_sumy[i].first);
	}

	if (stosy_piramida.size() > 0) {
		for (int i = 0; i <= m; i++) {
			int last = stosy_piramida.size() - 1;
			max_top_stos[last+1][i] = 0;
			for (int j = last; j >= 0; j--) {
				max_top_stos[j][i] = max(max_top_stos[j + 1][i], -stos_piramid_sumy[j].first - stos_sumy_partial[j][i]);
			}
		}
	}

	long long max_reward = 0;

	long long wynik = 0;
	for (int k = max(0, placki - (int) stosy_piramida.size() * m); k <= min(placki,(int) stosy_lejek.size() * m); k++) {
		if (k == 0)
			wynik = piramidy_suma(placki);
		else
			wynik = lejki_sumy[k - 1] + piramidy_suma(placki - k);
		max_reward = max(max_reward, wynik);
	}
	cout << max_reward;
}