Cod sursa(job #1981851)
Utilizator | Data | 17 mai 2017 00:48:47 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
using namespace std;
int main()
{
int v[5000],n,k,i,j,init,x=0,min,s=0;
cin>>n;
cin>>k;
for(i=1;i<=n;i++)
cin>>v[i];
while (x<=n)
{
min=v[x+1];
for(j=1+x;j<=k+x;j++)
{
if (v[j]<min)
{
min=v[j];}
}
x++;
s=s+min;
min=v[j+x];
}
cout<<s;
}