Cod sursa(job #717122)
| Utilizator | Data | 19 martie 2012 18:04:00 | |
|---|---|---|---|
| Problema | Deque | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
#include<set>
#include<deque>
using namespace std;
multiset<long> v;
deque<long> p;
int main()
{ifstream f("deque.in");
ofstream h("deque.out");
long long s=0;
int a,n,k,i;
f>>n>>k;
for(i=1;i<=k;i++)
{f>>a;
p.push_back(a);
v.insert(a);}
s=*v.begin();
for(i=k+1;i<=n;i++)
{ f>>a;
v.erase(p[0]);
v.insert(a);
p.pop_front();
p.push_back(a);
s=s+*v.begin();}
h<<s;
return 0;}