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
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
typedef pair<int, int> pii;
typedef long long ll;

const int INF = 1e9 + 7;

int n, k;
vector<vector<int> > wines;

void read() {
	cin >> n >> k;

	wines.resize(n + 1);

	for (int i = 1, x; i <= n; i++) {
		for (int j = 0; j < i; j++) {
			cin >> x;
			wines[i].PB(x);
		}
	}
}

void solve() {
	read();

	int ans = 2019;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < i; j++) {
			int iLeft = j + 1;
			int iRight = wines[i].size() - j;
			if (iLeft * iRight <= k) {
				ans = min(ans, wines[i][j]);
			}
		}
	}

	cout << ans << "\n";
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);

	solve();

	return 0;
}