1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include<bits/stdc++.h>
using namespace std;
int n, k, w[2001][2001], wyn = 2020;
int main()
{
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j<= i; ++j)
		cin >> w[i][j];
	}
	for (int j = 1; j <= n; ++j)
	{
		for (int i = 1; i<= n; ++i)
		{
			if (i*j <= k)	wyn = min(wyn, w[j+i-1][j]);
			else break; 
		}
	}
	printf ("%d", wyn); 
	return 0; 
}