Pagini recente » Cod sursa (job #1929929) | Cod sursa (job #2097704) | Cod sursa (job #1208966) | Cod sursa (job #1149261) | Cod sursa (job #2911268)
#include <iostream>
#include <fstream>
using namespace std;
int n, i, k, pos, minn, summ = 0, v[5000005];
int main() {
ifstream fin("deque.in");
ofstream fout("deque.out");
cin >> n >> k;
for (i = 1; i <= n; ++i) {
fin >> v[i];
}
for (i = 1, pos = i + k - 1; pos <= n; ++i, ++pos) {
minn = 10000005;
for (int j = i; j <= pos; ++j) {
if (v[j] < minn) {
minn = v[j];
}
}
summ = summ + minn;
}
fout << summ;
return 0;
}