Cod sursa(job #3218444)
Utilizator | Petre Cristian cristian46290 | Data | 27 martie 2024 11:10:06 |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <set>
#include <iterator>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long int rez = 0;
int n, k, a[5000005];
multiset <int> s;
int main()
{
f >> n >> k;
for (int i = 1;i <= n;i++){
f >> a[i];
if (i <= k)s.insert(a[i]);
else{
rez += *s.begin();
//it = s.find(a[i-k]);
s.erase(s.find(a[i-k]));
s.insert(a[i]);
}
}
rez += *s.begin();
g << rez;
}