#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k, tmp, ile_butelek = 0, minw = 2019; cin >> n >> k; vector <pair <int, int> > wino; for (int i = 1;i <= n;i++) for (int j = 1; j <= i;j++) { cin >> tmp; if (i == 1) wino.push_back(make_pair(1, tmp)); else { if (j == 1 || j == i) ile_butelek = i; else ile_butelek = wino[((i*(i-1)/2) + j) - i].first + i - j + 1; wino.push_back(make_pair(ile_butelek,tmp)); } if (ile_butelek <= k && tmp <= minw) minw = tmp; } cout << minw; }
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 <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k, tmp, ile_butelek = 0, minw = 2019; cin >> n >> k; vector <pair <int, int> > wino; for (int i = 1;i <= n;i++) for (int j = 1; j <= i;j++) { cin >> tmp; if (i == 1) wino.push_back(make_pair(1, tmp)); else { if (j == 1 || j == i) ile_butelek = i; else ile_butelek = wino[((i*(i-1)/2) + j) - i].first + i - j + 1; wino.push_back(make_pair(ile_butelek,tmp)); } if (ile_butelek <= k && tmp <= minw) minw = tmp; } cout << minw; } |