Cod sursa(job #3187309)
Utilizator | Data | 28 decembrie 2023 13:52:43 | |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n, k;
deque<int> dq;
multiset<int> M;
int main()
{
int i, nr, Rez;
Rez = 0;
fin >> n >> k;
for (i = 1; i <= n; i++)
{
fin >> nr;
dq.push_back(nr);
M.insert(nr);
if (i >= k)
{
Rez += *M.begin();
M.extract(M.find(dq.front()));
dq.pop_front();
}
}
fout << Rez << " ";
}