Die Zuckerbäckerin

#include <bits/stdc++> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } // Find the maximum sum of k consecutive elements int max_sum = 0; for (int i = 0; i + k - 1 < n; i++) { int sum = 0; for (int j = i; j < i + k; j++) { sum += a[j]; } max_sum = max(max_sum, sum); } cout << max_sum << endl; return 0; }