Cod sursa(job #3000225)
Utilizator | Data | 12 martie 2023 10:45:34 | |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long suma,n,k;
long long v[5000001];
unsigned int mem=1;
int main(){
fin>>n>>k;
for(int i = 1; i<=n; i++)
fin>>v[i];
for(int i = k; i<=n;i++){
long long min=10000001;
for(int j = mem;j<=i;j++){
if(min>v[j])
min=v[j];
}
mem++;
suma+=min;
//fout<<min<<'\n';
}
fout<<suma;
return 0;
}