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
#include <cstdio>
#include <limits>

using namespace std;

void solve();

int main()
{
    solve();
    return 0;
}

void solve()
{
    int n, k;
    scanf("%d %d", &n, &k);
    int oldest = numeric_limits<int>::max();
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= i; j++)
        {
            int a;
            scanf("%d", &a);
            int moves = (i - j + 1) * j;
            if(moves <= k && a < oldest)
                oldest = a;
        }
    }
    printf("%d\n", oldest);
}