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
#include <iostream>
#include <bitset>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{

    int n, k, r;
    //while (cin >> n >> k)
    //{
    cin >> n >> k;
    r = 3000;
    vector<vector<int>> m(n, vector<int>(n, 3000));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            cin >> m[i - j][j];
        }
    }
    //cout << endl;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if ((i + 1) * (j + 1) <= k)
                r = min(r, m[i][j]);
            //if ((i + 1) * (j + 1) <= k)
            //    cout << '*';
            //cout << m[i][j] << '\t';
        }
        //cout << endl;
    }
    cout << r; // << endl;
    //}
}