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

int tab[2007][2007];

int main(){
	
	ios_base::sync_with_stdio(0);
	
	int n, k;
	cin>>n>>k;
	
	int wyn;
	cin>>wyn;
	
	for(int i=2;i<=n;i++){
		for(int j=1;j<=i;j++){
			
			int wart;
			cin>>wart;
			
			tab[i][j]=tab[i-1][j]+tab[i-1][j-1]-tab[i-2][j-1]+1;
			if(tab[i][j]<k){
				wyn=min(wyn, wart);
			}
			
			//cout<<tab[i][j]<<" ";
		}
		
	
		//cout<<endl;
	}
	
	//
	cout<<wyn;
	return 0;
}