Pagini recente » Cod sursa (job #2286451) | Cod sursa (job #441283) | Cod sursa (job #2712749) | Cod sursa (job #3264562) | Cod sursa (job #972747)
Cod sursa(job #972747)
#include <fstream>
#include <set>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,a[5000011];
multiset<int> v;
multiset<int>::iterator it;
int main(void){
register int i,j,x,p=0;
register long long sum=0;
f>>n>>k>>a[1];
v.insert(a[1]),p=1;
for(i=2;i<=n;i++){
f>>a[i];
v.insert(a[i]);
if(i<k)
continue;
if(i>k){
v.erase(a[p]);
p++;
}
// g<<*v.begin()<<"\n";
sum+=*v.begin();
}
g<<sum;
return 0;
}