Cod sursa(job #2520172)
| Utilizator | Data | 9 ianuarie 2020 02:04:40 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, v[500000], s, x, q, minim = 99999999;
int main()
{
fin >> n >> q;
for(int i=1; i<=n; i++)
fin>>v[i];
for(int i=1; i<=n - q + 1; i++)
{
for(int j = i; j<=i + q - 1; j++)
{
if(minim > v[j])
minim = v[j];
}
s = s + minim;
minim = 999999999;
}
fout<<s;
}
