Cod sursa(job #1121984)
Utilizator | Data | 25 februarie 2014 15:09:56 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
long long n,k,s,i,j,vmin,a[5000002];
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
}
s=0;
for(i=1;i+k-1<=n;i++)
{
vmin=a[i];
for(j=i+1;j<=i+k-1;j++)
{
if(a[j]<vmin)
{
vmin=a[j];
}
}
s=s+vmin;
}
g<<s;
g.close();
f.close();
return 0;
}