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> 
using namespace std; 
  
int main() 
{ 
    int n; 
    cin >> n; 
    int k;
    cin >> k; 
      
    int tmp;
    int min = 2019;
	int col = 1;
	int row = 1;
	int max_row = 1;
    for (int i = 0; i < (n*(n+ 1)/2); i++) {
		cin >> tmp;
		
		if ((row * (col - row + 1)) <= k) {
			if (tmp < min) {
				min = tmp;
			}
		}

		if (row == max_row) {
			col++;
			max_row++;
			row = 1;
		} else {
			row++;
		}
		
		if (col > k) {
			cout << min; 
			return 0;
		}
		
	} 
	cout << min; 
    return 0; 
}