Pagini recente » Cod sursa (job #1517533) | Cod sursa (job #1998544) | Cod sursa (job #752012) | Cod sursa (job #884560) | Cod sursa (job #3164494)
#include<fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int a[5000005], n, k, i, j, min1, x;
long long s;
int main()
{
cin>>n>>k;
cin>>min1;
for(i=1; i<=k-1; i++)
{
cin>>a[i];
if(a[i]<min1)
min1=a[i];
}
s=min1;
for(i=k; i<=n-1; i++)
{
cin>>x;
a[i%k]=x;
min1=x;
for(j=0; j<=k-1; j++)
if(a[j]<min1)
min1=a[j];
s+=min1;
}
cout<<s;
}