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
54
55
56
57
58
59
60
61
62
63
64
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(LL x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); ––x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) __typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) (int)x.size()
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second

int n, k;
int wines[2000][2000];

int main() {

    cin >> n >> k;
    int result, year;
    
    cin >> result;
    wines[0][0] = 1;
    
    FOR(i, 1, n-1) {
        REP(j, i+1){
            cin >> year;
            if(j == 0) {
                wines[i][j] = wines[i-1][0] + 1;
                //cout << i << " " << j << "=" << wines[i][j] << endl;
                if ((wines[i][j] <= k) && (year < result))
                    result = year;
                continue;
            }
            
            if(j == i) {
                wines[i][j] = wines[i-1][j-1] + 1;
                //cout << i << " " << j << "=" << wines[i][j] << endl;
                if ((wines[i][j] <= k) &&(year < result))
                    result = year;
                continue;
            }
            
            wines[i][j] = wines[i-1][j-1] + wines[i-1][j] - wines[i-2][j-1] + 1;
             if ((wines[i][j] <= k) &&(year < result))
                    result = year;
            //cout << i << " " << j << "=" << wines[i][j] << endl;
        }
    }
    
    cout << result;
    
	return 0;
}