Cod sursa(job #2794745)
Utilizator | Data | 5 noiembrie 2021 13:01:51 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int A[10001],N,k,i=0,s=0,Min;
deque <int> deq;
int main()
{
cin>>N>>k;
for(int j=0;j<N;j++)
{
cin>>A[j];
}
while(i<=N-k)
{
Min=A[i];
for(int j=0;j<k;j++)
{
if(A[i+j]<Min)
{
Min=A[i+j];
}
}
s=s+Min;
i++;
}
cout<<s;
return 0;
}