#define pb push_back #define mp make_pair #define fi first #define se second #include<bits/stdc++.h> using namespace std; int n,k,w,a,b; vector <pair<int,pair<int,int> > > v; int main() { scanf("%d%d", &n, &k); for(int i=1;i<=n;++i) { for(int j=1;j<=i;++j) { scanf("%d", &w); v.pb(mp(w,mp(i,j))); } } sort(v.begin(),v.end()); for(int i=0;i^v.size();++i) { a=v[i].se.fi; b=v[i].se.se; w=b*(a-b+1); if(w<=k) { printf("%d\n", v[i].fi); return 0; } } return 0; } /* 5 7 1999 2019 2010 850 1500 1600 900 900 710 900 1000 800 600 800 1000 */
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 | #define pb push_back #define mp make_pair #define fi first #define se second #include<bits/stdc++.h> using namespace std; int n,k,w,a,b; vector <pair<int,pair<int,int> > > v; int main() { scanf("%d%d", &n, &k); for(int i=1;i<=n;++i) { for(int j=1;j<=i;++j) { scanf("%d", &w); v.pb(mp(w,mp(i,j))); } } sort(v.begin(),v.end()); for(int i=0;i^v.size();++i) { a=v[i].se.fi; b=v[i].se.se; w=b*(a-b+1); if(w<=k) { printf("%d\n", v[i].fi); return 0; } } return 0; } /* 5 7 1999 2019 2010 850 1500 1600 900 900 710 900 1000 800 600 800 1000 */ |