Pagini recente » Cod sursa (job #625206) | Cod sursa (job #2829910) | Cod sursa (job #2948260) | Cod sursa (job #1116759) | Cod sursa (job #2406686)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int Maxim = 1000000;
vector< int > v;
int n , k ;
void citire()
{
ifstream in("deque.in");
in>>n>>k;
int x;
for(int i = 0 ; i < n; i++)
{ in>>x; v.push_back(x);}
in.close();
}
void rezolvare()
{
int z , alfa ,sum =0;
for(int i =0 ; i <= n - k ; i++)
{
int mini = Maxim;
for(z =0 , alfa = i ; z < k ; alfa++ , z++ )
{
if(v[alfa] < mini )
mini = v[alfa];
}
sum+= mini;
}
ofstream out("deque.out");
out<<sum <<'\n';
}
int main()
{
citire();
rezolvare();
return 0;
}