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
#include <iostream>
using namespace std;

#define N 2000

int main()
{
    short wina[N][N];
    int n, k, min = 2020;
    cin >> n >> k;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j <= i; ++j)
            cin >> wina[i][j];

    for (int i = 0; i < n; ++i)
        for (int j = 0; j <= i; ++j)
        {
            int x = (i + 1 - j) * (j + 1);
            if (x > 0 && x <= k && min > wina[i][j])
                min = wina[i][j];
        }
    cout << min;
    return 0;
}



/*
 * 1
 * 2 2
 * 3 4 3
 * 4 6 6 4
 * 5 8 9 8 5
 * 6     6
 */