#include <bits/stdc++.h> using namespace std; #define endl '\n' int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, p = 1, w = 0; cin >> n >> k; int t[n][n] = {}, l[n][n] = {}; for(int i = 0; i < n; i++) { for(int j = 0; j < p; j++) { cin >> t[i][j]; if(w == 0) { w = t[i][j]; } else { if(j != 0 && j != p - 1) { l[i][j] = l[i - 1][j - 1] + i - j + 1; } else { l[i][j] = i; } if(l[i][j] < k && t[i][j] < w) { w = t[i][j]; } } } p++; } cout << w; }
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 | #include <bits/stdc++.h> using namespace std; #define endl '\n' int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, p = 1, w = 0; cin >> n >> k; int t[n][n] = {}, l[n][n] = {}; for(int i = 0; i < n; i++) { for(int j = 0; j < p; j++) { cin >> t[i][j]; if(w == 0) { w = t[i][j]; } else { if(j != 0 && j != p - 1) { l[i][j] = l[i - 1][j - 1] + i - j + 1; } else { l[i][j] = i; } if(l[i][j] < k && t[i][j] < w) { w = t[i][j]; } } } p++; } cout << w; } |