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
#include <bits/stdc++.h>

using namespace std;

#define int long long

int dp[2010][2010];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n, k;
    cin >> n >> k;
    int res = 100000;
    for (int a, i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            cin >> a;
            dp[i][j] = 1 + dp[i - 1][j - 1] + dp[i - 1][j];
            if (i >= 2) {
                dp[i][j] -= dp[i - 2][j - 1];
            }
            
            if (dp[i][j] <= k) {
                res = min(res, a);
            }
        }
    }
    
    cout << res;
    
    return 0;
}
/*
5 7
1999
2019 2010
850 1500 1600
900 900 710 900
1000 800 600 800 1000
 */