#include<stdio.h>

int min(int a, int b){return a>b?b:a;}

const int INF = 0x3fffffff;

int N, M;
int p[2002];
int c[2002];
int d[2002][22];

int main(){
//	freopen("input.txt","r",stdin);
	scanf("%d %d", &N, &M); M ++;
	for(int i = 1 ; i <= N ; i ++) scanf("%d", &p[i]);
	for(int i = 1 ; i <= N ; i ++) c[i] = c[i-1] + p[i];
	
	for(int i = 0 ; i <= N ; i ++)
		for(int j = 0 ; j <= M ; j ++)
			d[i][j] = INF;

	d[0][0] = 0;
	for(int i = 1 ; i <= N ; i ++){
		for(int j = 1 ; j <= M ; j ++){
			for(int k = 1 ; k <= i ; k ++){
				int sum = c[i]-c[i-k];
				int md = sum%10;
				sum = md < 5 ? sum-md : sum-md+10;
				d[i][j] = min(d[i][j], d[i-k][j-1] + sum);
			}
		}
	}

	int ans = INF;
	for(int i = 1 ; i <= M ; i ++) ans = min(ans, d[N][i]);
	printf("%d\n", ans);
}