Cod sursa(job #2785709)
| Utilizator | Data | 19 octombrie 2021 11:52:39 | |
|---|---|---|---|
| Problema | Deque | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
#define N 5000005
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k;
int a[N];
void rezolva()
{
int i,j;
fin>>n>>k;
long long s;
s=0;
int minim=10000000;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n-2;i++)
{
minim=10000000;
for(j=i;j<=k+i-1;j++)
{
if(a[j]<minim) minim=a[j];
}
s+=minim;
}
fout<<s;
}
int main()
{
rezolva();
return 0;
}
