#include <cstdio> #include <algorithm> using namespace std; int main() { int n, k; scanf("%d%d", &n, &k); int ret = 1000000; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { int a; scanf("%d", &a); int r = j * (i - j + 1); if (r <= k) ret = min(ret, a); } } printf("%d\n", ret); return 0; }
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 | #include <cstdio> #include <algorithm> using namespace std; int main() { int n, k; scanf("%d%d", &n, &k); int ret = 1000000; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { int a; scanf("%d", &a); int r = j * (i - j + 1); if (r <= k) ret = min(ret, a); } } printf("%d\n", ret); return 0; } |