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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a,  b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ITH_BIT(m, i) ((m)>>(i) & 1)
#define PPC(x) __builtin_popcount(x)

#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = std::min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = std::max(a, (T1)b);	}

const int maxN = 1 << 19;

long long decsFinal[maxN], incsFinal[maxN];

namespace INCS
{
	std::vector <std::vector <long long> > prefInRow, prefOfSufs, sufOfPrefs;
	std::vector <long long> sums;
	int n, m;

	void order(std::vector <std::vector <long long> >& stock)
	{
		for (auto& row : stock)
		{
			auto sum = std::accumulate(row.begin(), row.end(), 0ll);
			row.push_back(sum);
		}

		std::ranges::sort(stock, [](const auto& a, const auto& b) -> bool {
			return a.back() > b.back();
		});

		for (auto& row : stock)
		{
			sums.push_back(row.back());
			row.pop_back();
		}
	}

	void precomp(std::vector <std::vector <long long> >& stock)
	{
		prefInRow = stock;
		for (auto& prefRow : prefInRow)
			FOR(j, 1, m)
				prefRow[j] += prefRow[j-1];

		prefOfSufs = prefInRow;
		FOR(i, 0, n)
			for (long long& p : prefOfSufs[i])
				p = sums[i] - p;
		FOR(i, 1, n)
			FOR(j, 0, m)
				remin(prefOfSufs[i][j], prefOfSufs[i-1][j]);

		sufOfPrefs = prefInRow;
		FORD(i, n-2, -1)
			FOR(j, 0, m)
				remax(sufOfPrefs[i][j], sufOfPrefs[i+1][j]);
	}

	int compute()
	{
		int incsN = 1;
		long long rowsPrefPrev = 0;

		FOR(i, 0, n)
		{
			long long rowsPrefCurr = rowsPrefPrev + sums[i];

			FOR(j, 0, m)
			{
				long long a = rowsPrefCurr - prefOfSufs[i][j];
				long long b = rowsPrefPrev + sufOfPrefs[i][j];

				incsFinal[incsN++] = std::max(a, b);
			}

			rowsPrefPrev = rowsPrefCurr;
		}

		assert(incsN == n * m + 1);
		return incsN;
	}

	int computeIncs(std::vector <std::vector <long long> >& stock)
	{
		if (stock.empty())
			return 1;

		n = SZ(stock), m = SZ(stock.front());
		order(stock);
		precomp(stock);

		int incsN = compute();
		return incsN - 1;
	}
}

int computeDecs(const std::vector <std::vector <long long> >& stock)
{
	int p = 1;

	for (const auto& row : stock)
		std::ranges::copy(row, decsFinal + p), p += row.size();

	std::sort(decsFinal + 1, decsFinal + p, std::greater<long long>());
	FOR(i, 1, p)
		decsFinal[i] += decsFinal[i-1];
	return p-1;
}

void solve()
{
	int n, m, k;
	scanf ("%d%d%d", &n, &m, &k);

	std::vector <std::vector <long long> > decs, incs;

	FOR(i, 0, n)
	{
		std::vector <long long> buf(m);
		for (long long& x : buf)
			scanf ("%lld", &x);

		auto& stock = buf[0] < buf[m-1] ? incs : decs;
		stock.push_back(buf);
	}

	int decsN = computeDecs(decs);
	int incsN = INCS::computeIncs(incs);

	long long res = 0;
	FOR(i, 0, k+1)
		if (i <= decsN and k-i <= incsN)
			remax(res, decsFinal[i] + incsFinal[k - i]);
	printf("%lld\n", res);
}

int main()
{
	int tc = 1;
//	scanf ("%d", &tc);	

	FOR(cid, 1, tc+1)
	{
//		printf("Case #%d: ", cid);
		solve();
	}
	return 0;
}