Cod sursa(job #2031618)
Utilizator | Marin Vasile Peptenaru MarinPeptenaru | Data | 3 octombrie 2017 16:53:48 |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
queue < int > q;
multiset < int > v;
int n,x,k;
long long sum=0;
int main()
{
int i;
in>>n>>k;
for(i=1; i<=k; i++)
{
in>>x;
q.push(x);
v.insert(x);
}
sum+=*v.begin();
v.erase(v.find(q.front()));
q.pop();
for(;i<=n; i++)
{
in>>x;
q.push(x);
v.insert(x);
sum+=*v.begin();
v.erase(v.find(q.front()));
q.pop();
}
out<<sum;
return 0;
}