Pagini recente » Cod sursa (job #1887752) | Cod sursa (job #1929035) | Cod sursa (job #2926032) | Cod sursa (job #2731443) | Cod sursa (job #1060895)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("degue.out");
#define nn 500000
#define xii 100000000
int main()
{
int a[nn],i,n,k,j=1,s=0,min;
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
while(k<=n)
{
min=xii;
for(i=j;i<=k;i++)
{
if(a[i]<min)
min=a[i];
}
s=s+min;
j++;
k++;
}
g<<s;
f.close();
g.close();
return 0;
}