Cod sursa(job #2726400)
| Utilizator | Data | 20 martie 2021 20:36:03 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
int main()
{
std::ifstream f("deque.in");
int N, K, Minim, Suma;
f >> N >> K;
int deq[K];
f >> Minim;
deq[0] = Minim;
for(int i = 1; i < K; ++i)
{
f >> deq[i];
if(deq[i] < Minim)
Minim = deq[i];
}
Suma = Minim;
unsigned poz = 0;
while(f >> deq[poz])
{
Minim = deq[poz];
for(int i = 0; i < K; ++i)
if(deq[i] < Minim)
Minim = deq[i];
Suma += Minim;
++poz %= K;
}
std::ofstream g("deque.out");
g << Suma;
return 0;
}
