Cod sursa(job #540747)
Utilizator | Data | 24 februarie 2011 12:47:45 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream.h>
#include<fstream.h>
#include<conio.h>
ifstream f("deque.in");
ofstream g("deque.out");
int n, k, i, j, m, s, a[100];
int main()
{f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
s=0;
for(i=1;i<=n-k+1;i++)
{m=a[i];
for (j=i+1;j<=i+k-1;j++)
if(a[j]<m)
m=a[j];
s=s+m;
}
g<<s;
f.close();
g.close();
getch();
return 0;
}