Cod sursa(job #3128114)
Utilizator | Data | 8 mai 2023 18:11:56 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <algorithm>
#include <deque>
#include <limits>
using namespace std;
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
int n, k, sum = 0;
f >> n >> k;
deque<int> d;
for (int i = 0; i < n; i++)
{
int num;
f >> num;
d.push_back(num);
if (static_cast<int>(d.size()) > k)
{
d.pop_front();
}
if (static_cast<int>(d.size()) == k)
{
int min = *min_element(d.begin(), d.end());
sum += min;
}
}
g << sum;
f.close();
g.close();
return 0;
}