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, a, ans;
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>k;
	vector<vector<int>>dp(n+1, vector<int>(n+1));
	ans=2019;
	for(int i=1; i<=n; ++i) {
		for(int j=1; j<=i; ++j) {
			cin>>a;
			dp[i][j]=dp[i-1][j-1]+dp[i-1][j]+1;
			if(i>1) {
				dp[i][j]-=dp[i-2][j-1];
			}
			if(dp[i][j]<=k) {
				ans=min(ans, a);
			}
		}
	}
	cout<<ans<<'\n';
}