#include<cstdio> #include<algorithm> int main(){ int n, k; scanf("%i %i", &n, &k); int wyn = 2020; for(int i = 1; i <= n; ++i){ for(int j = 1; j <= i; ++j){ int w; scanf("%i", &w); int l = (j*(j-1))/2; int r = ((i-j)*(i+1-j))/2; if(l+r+k >= (i*(i+1))/2) { wyn = std::min(wyn, w); } } } printf("%i\n", wyn); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | #include<cstdio> #include<algorithm> int main(){ int n, k; scanf("%i %i", &n, &k); int wyn = 2020; for(int i = 1; i <= n; ++i){ for(int j = 1; j <= i; ++j){ int w; scanf("%i", &w); int l = (j*(j-1))/2; int r = ((i-j)*(i+1-j))/2; if(l+r+k >= (i*(i+1))/2) { wyn = std::min(wyn, w); } } } printf("%i\n", wyn); return 0; } |