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
//
//  main.cpp
//  Wina [B]
//
//  Created by Jędrzej Dudzicz on 09/12/2019.
//  Copyright © 2019 Jędrzej Dudzicz. All rights reserved.
//

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
int n,k,dp[2005][2005],min1=200000;
int main(){
    ios_base::sync_with_stdio(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=i;j++){
            cin>>dp[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=i;j++){
            if((j)*(i-j+1)<=k){
                min1=min(dp[i][j],min1);
            }
        }
    }
    cout<<min1<<endl;
}