Pagini recente » Atasamentele paginii Ciclu hamiltonian de cost minim | Cod sursa (job #1813277) | Cod sursa (job #3195574) | Cod sursa (job #2383415) | Cod sursa (job #2911850)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("adunare.in");
ofstream g("adunare.out");
int main()
{
int n, k, v[100001], min, suma=0, i, j;
f>>n>>k;
for(i=0;i<n;i++)
f>>v[i];
j=0;
for(i=k-1;i<n;i++){
min=v[i-k+1];
for(j=i-k+1;j<=i;j++){
if(v[j]<min){
min=v[j];
}
}
suma+=min;
}
g<<suma;
return 0;
}