Cod sursa(job #1917489)
| Utilizator | Data | 9 martie 2017 12:23:30 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int n,i,p,j,v[5000001];
int mi;
long long s;
int main()
{
in>>n>>p;
for(i=1;i<=n;i++) in>>v[i];
s=0;
for(i=1;i<=n-p+1;i++)
{
mi=10000001;
for(j=0;j<p;j++)
{
if(v[i+j]<mi) mi=v[j+i];
}
s=s+mi;
}
out<<s;
return 0;
}
