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

using namespace std;

int main()
{
    std::ios::sync_with_stdio(false);
    int n, k;
    int min, win;
    array<int, 2009> a, b, c;
    array<int, 2009> *prepre, *pre, *cur, *tmp;

    min = 2020;
    prepre = &a;
    pre = &b;
    cur = &c;

    cin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= i; ++j)
        {
            if (j - 1 >= 1 && j - 1 < i - 1)
            {
                (*cur)[j] = (*prepre)[j-1] + i;
            }
            else
            {
                (*cur)[j] = i;
            }

            cin >> win;
            if ((*cur)[j] <= k)
            {
                min = min > win ? win : min;
            }
        }

        tmp = prepre;
        prepre = pre;
        pre = cur;
        cur = tmp;
    }

    cout << min << endl;

    return 0;
}