# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91293 | Hideo | K blocks (IZhO14_blocks) | C++14 | 7 ms | 2040 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int INF = 1e9 + 7;
int a[N], us[N], prf[N];
int n, k, mx, s, ans;
int l, r;
main(){
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++){
scanf("%d", &a[i]);
mx = max (mx, a[i]);
us[a[i]]++;
prf[i] = prf[i - 1] + a[i];
}
int k1 = k - 1;
for (int i = 1; k1 > 0; i++){
if (a[i] == mx && us[a[i]] == 1)
break;
us[a[i]]--;
k1--;
l++;
}
r = n + 1;
for (int i = n; k1 > 0; i--){
if (a[i] == mx && us[a[i]] == 1)
break;
us[a[i]]--;
k1--;
r--;
}
ans = prf[l] + (prf[n] - prf[r - 1]);
while (l >= 0){
if (us[mx] > 0) s = prf[l] + (prf[n] - prf[r - 1]);
us[a[l]]++;
l--;
r--;
us[a[r]]--;
ans = min(ans, s);
}
cout << ans + mx;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |