Cod sursa(job #964709)
Utilizator | cont teste cnt_tst | Data | 22 iunie 2013 10:03:23 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<set>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int n,k,i, v[5000010];
long long suma;
multiset<int> s;
multiset<int>::iterator it;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=k;i++)
{
s.insert(v[i]);
}
it = s.begin();
suma += *it;
for(i=k+1;i<=n;i++){
s.insert(v[i]);
s.erase(v[i-k]);
it=s.begin();
suma +=(long long)*it;
}
fout<<suma;
return 0;
}