Pagini recente » Cod sursa (job #1298971) | Istoria paginii runda/pregatire_oji_5/clasament | Cod sursa (job #1916339) | Cod sursa (job #1544621) | Cod sursa (job #2889397)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,d[5000002],v[5000002],k,i=1,j,fr,m,mn=10000001,sum;
int main() {
f >> n >> k;
while(i<=n)
{
f>>d[m];
for(j=fr;j<=m;j++)
{
if (d[j] < mn)
{
mn = d[j];
}
}
m++;
if(i>=k)
{
sum+=mn;
fr++;
mn=d[fr];
}
i++;
}
g<<sum;
return 0;
}