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
// PA 2024 2B - Stosy nalesnikow
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

struct Item {
	long long wgh;
	long long val;
	
	Item(long long wgh, long long val) {
		this->wgh = wgh;
		this->val = val;
	}
};

int main()
{
	ios_base::sync_with_stdio(0);
	long long n, m, cap, a, aSum;
	vector<Item> items;
	vector<long long> prevBest;
	vector<long long> best;
	
	cin >> n;
	cin >> m;
	cin >> cap;
	
	for (long long i = 0; i < n; ++i) {
		aSum = 0;
		for (long long j = 0; j < m; ++j) {
			cin >> a;
			aSum += a;
			items.push_back(Item(j + 1, aSum));
		}
	}
	
	for (long long i = 0; i <= cap; ++i) {
		prevBest.push_back(0);
		best.push_back(0);
	}
	
	for (long long i = 0; i < n; ++i) {
		//cout << "i: " << i << endl;
		for (long long k = 0; k <= cap; ++k) {
			best[k] = prevBest[k];
			for (long long j = 0; j < m; ++j) {
				if (k >= items[i * m + j].wgh) {
					if (best[k] < prevBest[k - items[i * m + j].wgh] + items[i * m + j].val) {
						best[k] = prevBest[k - items[i * m + j].wgh] + items[i * m + j].val;
					}
				} else {
					break;
				}
			}
		}
		for (long long k = 0; k <= cap; ++k) {
			prevBest[k] = best[k];
		}		
	}
	
	cout << best[cap] << endl;		
	
	return 0;
}