Pagini recente » Cod sursa (job #2483342) | Cod sursa (job #2897112) | Cod sursa (job #1439869) | Cod sursa (job #1780101) | Cod sursa (job #2720898)
#include <iostream>
#include <cstdlib>
#include <fstream>
int main()
{
std::ifstream f("deque.in");
if (!f.is_open())
{
return 1;
}
int n, k;
f >> n >> k;
int *v;
v = new int[n];
int vindex = 0;
for (int i = 0; i < n; i++)
{
int nr;
f >> nr;
v[vindex++] = nr;
}
int suma = 0;
for(int i=0; i<=n - k; i++)
{
int minim = v[i];
for (int j = 0; j < k; j++)
{
int val = v[i + j];
if (val < minim) { minim = val; }
}
std::cout << minim << " ";
suma += minim;
}
f.close();
delete[] v;
std::ofstream fout("deque.out");
fout << suma;
fout.close();
return 0;
}