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

#define BOOST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FOR(a, b, c) for(int a = b; a < c; ++a)

using namespace std;
const int MAX = 2007;

int piramida[MAX][MAX];

bool check(int x, int y, int k)
{
    //cout << x << " " << y << "\n";
    int lewa = y;
    int prawa = x - y;

    int minn = min(prawa, lewa);
    int maxx = max(prawa, lewa);

    int res = 0;
    int start = 1;

    if(minn >= 0)
    {
        res += (2 + minn) * (minn + 1) / 2;
        start = 1 + minn;
    }

    if(minn != maxx)
    {
        res += (start) * (maxx - minn);
    }

    if(x >= 0)
    {
        res += (1 + x - maxx) * (x - maxx) / 2;
    }

    //cout << res << "\n";

    if(res <= k)
        return true;
    return false;
}

int main()
{
    BOOST;

    int n, k;
    cin >> n >> k;
    int res = 3000;

    FOR(i, 0, n)
    {
        FOR(j, 0, i + 1)
        {
            cin >> piramida[i][j];
            if(check(i, j, k)) res = min(res, piramida[i][j]);
        }
    }

    cout << res << "\n";
    
    return 0;
}