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
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
int main()
{

ios_base::sync_with_stdio(false);
cin.tie(NULL);


int n,k;
cin>>n>>k;
int h = n*(n+1)/2;
int b = 1;
vector < int > dane;
int g;
for(int i=0;i<n;i++)
{
	for(int j=1;j<=b;j++)
	{
		if((j*(b-j+1))<=k){
		
		cin>>g;
		dane.push_back(g);
		}
		else
		cin>>g;
	}
	b++;
}
sort(dane.begin(),dane.end());
cout<<dane[0];






}