Cod sursa(job #312134)
Utilizator | Tirca Bogdan Bogdan_tmm | Data | 5 mai 2009 10:30:23 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<stdio.h>
#include<deque>
int n,i,x,k,s;
deque <int> Q;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=0;i<n;i++)
{
scanf("%d",&x);
while(!Q.empty()&&Q.back()>x)
Q.pop_back();
if(Q.size()<k)
Q.push_back(x);
if(i+1==k)
{
s+=Q.front();
Q.pop_front();
}
}
printf("%d\n",s);
return 0;
}