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

using namespace std;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	unsigned int k, steps;
	unsigned short n, tWine;
	cin >> n >> k;

	vector<unsigned short> wineList;
	unsigned short curOldest = 2019;
	for (unsigned short i = 0; i < (n < k ? n : k); i++)
	{
		wineList.clear();
		steps = 0;
		for (short j = -1; j < i; j++)
		{
			cin >> tWine;
			wineList.push_back(tWine);
		}
		for (unsigned short j = 0; j <= (i + 1) / 2; j++)
		{
			steps += i + 1 - 2 * j;
			if (steps <= k)
			{
				if (wineList[j] < curOldest)
				{
					curOldest = wineList[j];
				}
				if (wineList[i - j] < curOldest)
				{
					curOldest = wineList[i - j];
				}
			}
		}
	}
	cout << curOldest;
	return 0;
}