#include #define MAX 10000 #define INF 1000000000000000000 using namespace std; int n,k; long long int c[MAX],dp[MAX][1000]; long long int func(int i,int d){ if (d==k+1) return INF; if (i==n) return 0; if (dp[i][d]) return dp[i][d]; dp[i][d] = min(func(i+1,d+1),func(i+1,0)+c[i]); return dp[i][d]; } int main(){ scanf("%d%d",&n,&k); for (int i=0;i>c[i]; cout << func(0,0); return 0; }