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
#include <iostream>
#include <set>

using namespace std;
int main() {
    int n, k;
    cin >> n >> k;

    set <pair<int, int>> zb;

    int rok;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            cin >> rok;
            int tmp = (i-j+1)*j;

            if (tmp <= k) {
                zb.insert(make_pair(rok, tmp));
            }
        }
    }

    cout << (*zb.begin()).first;
}