Cod sursa(job #547513)
Utilizator | Data | 6 martie 2011 13:59:17 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
# include <fstream.h>
ifstream f("deque.in");
ofstream g("deque.out");
long long n,k,i,j,s,min,v[5000000];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-k+1;i++)
{min=v[i];
for(j=i;j<=k+i-1;j++)
{ if(min>v[j])
min=v[j];
}
s=s+min;
}
g<<s<<'\n';
f.close();
g.close();
return 0;
}