/* PA 2019 [B] Wina (WIN) Bartosz Pieszko */ #include <bits/stdc++.h> int main() { int n, k; std::cin >> n >> k; int x, res = 1 << 30; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= i; ++j) { std::cin >> x; if ((i - j + 1) * j <= k) res = std::min(res, x); } } std::cout << res << std::endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 | /* PA 2019 [B] Wina (WIN) Bartosz Pieszko */ #include <bits/stdc++.h> int main() { int n, k; std::cin >> n >> k; int x, res = 1 << 30; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= i; ++j) { std::cin >> x; if ((i - j + 1) * j <= k) res = std::min(res, x); } } std::cout << res << std::endl; return 0; } |