Cod sursa(job #2664759)
Utilizator | Data | 29 octombrie 2020 12:05:46 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
using namespace std;
int main() {
int n, k, i, v[10];
cin >> n >> k;
int minim, suma = 0;
for (i = 0; i < n; i++) {
cin >> v[i];
if (i >= k - 1) {
minim = v[i];
for (int j = i; j > i - k; j--) {
if (v[j] < minim)
minim = v[j];
}
suma += minim;
}
}
cout << suma;/**/
return 0;
}