-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbuying_items.cpp
More file actions
44 lines (38 loc) · 1.01 KB
/
buying_items.cpp
File metadata and controls
44 lines (38 loc) · 1.01 KB
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, k, x;
vector<int> v;
cin >> n >> m >> k;
for(int i = 0; i < n; i++)
{
cin >> x;
if(x == 1)
v.push_back(i);
}
long long final_ans, ans = 0;
if(v.size() < m)
cout << -1 << endl;
else
{
for(int i = 0; i < m; i++)
{
if(i == 0)
ans += v[i];
else ans += (long long)(v[i] - v[i-1])*k*(i);
}
final_ans = ans;
for(int i = m; i < v.size();i++)
{
long long left_ptr, decrement, left_increment, right_increment;
decrement = (long long)(v[i-1]-v[i-m])*k;
left_increment = v[i-m+1]-v[i-m];
right_increment = (long long)(v[i]-v[i-1])*(m-1)*k;
ans = ans - decrement + left_increment + right_increment;
final_ans = min(final_ans, ans);
}
cout << final_ans << endl;
}
return 0;
}