Cod sursa(job #1703073)
Utilizator | Data | 16 mai 2016 09:23:29 | |
---|---|---|---|
Problema | Deque | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
deque <int> q;
int n,k,x,minn,s;
int main()
{
in>>n>>k;
for(int i=1;i<=n;i++){
in>>x;
q.push_back(x);
}
for(int i=0;i<n;i++){
minn=q[i];
for(int it=i+1;it<k+i;it++){
if(q[it] < minn){
minn=q[it];
}
}
s+=minn;
}
out<<s;
return 0;
}