Submission #345199

#TimeUsernameProblemLanguageResultExecution timeMemory
345199bachaquerK blocks (IZhO14_blocks)C++14
0 / 100
1 ms512 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back using namespace std; int main() { ll n, k, x; cin >> n >> k; vector<ll> v; ll mx2 = 0; for (int i = 0; i < n; i++) { cin >> x; v.pb(x); mx2 = max(x, mx2); } ll mx = LONG_MAX; for (int i = 0; i <= k - 1; i++) { ll sum = 0; for (int j = 0; j < k - 1 - i; j++) { sum += v[j]; //cout << v[j] << " "; } //cout << '\t'; for (int j = n - 1; j > n - 1 - i; j--) { sum += v[j]; //cout << v[j] << " "; } //cout << " and "; ll mxx = 0; for (int j = k - 1 - i; j <= n - 1 - i; j++) { mxx = max(mxx, v[j]); //cout << v[j] << " "; } sum += mxx; //cout << " hm. "<< sum << "\n"; mx = min(sum, mx); } if (k == 1) mx = mx2; cout << mx; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...