Cod sursa(job #3269113)
Utilizator | Data | 18 ianuarie 2025 11:09:36 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int v1[500001],nr,dis,start;
int s=0;
cin>>nr>>dis;
start=1;
for(int i=start;i<=nr;i+=1)
{
int x;
cin>>x;
v1[i]=x;
}
while(start<= nr-dis+1)
{
int minim = v1[start];
for(int i=start ; i<= start+dis-1 ; i+=1)
{
if(v1[i] < minim )
minim = v1[i];
}
s=s+minim;
start++;
}
cout<<s;
return 0;
}