Cod sursa(job #743376)
Utilizator | Data | 4 mai 2012 01:46:40 | |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <set>
#define LE 5000007
#define ll long long
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
multiset <ll> S;
multiset<ll>::iterator it;
ll V[LE],k,m,Suma;
int main()
{
ll n,i;
f>>n>>m;
for(i=1;i<=n;++i)
{
f>>V[i];
if (i>m)
S.erase(S.find(V[i-m]));
S.insert(V[i]);
if (i>=m)
{
it=S.begin();
Suma+=*it;
}
}
g<<Suma<<'\n';
f.close();
g.close();
return 0;
}