#include <iostream> using namespace std; int treeSize(int num) { return num < 1 ? 0 : ((1 + num) * num) / 2; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, year, result = 2020; cin >> n >> k; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { cin >> year; int minBottles = treeSize(i) - treeSize(j - 1) - treeSize(i - j); if (minBottles <= k && result > year) { result = year; } } } cout << result << endl; 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 | #include <iostream> using namespace std; int treeSize(int num) { return num < 1 ? 0 : ((1 + num) * num) / 2; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k, year, result = 2020; cin >> n >> k; for (int i = 1; i <= n; i++) { for (int j = 1; j <= i; j++) { cin >> year; int minBottles = treeSize(i) - treeSize(j - 1) - treeSize(i - j); if (minBottles <= k && result > year) { result = year; } } } cout << result << endl; return 0; } |