package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	in := bufio.NewReader(os.Stdin)
	var n, k int
	if _, err := fmt.Fscan(in, &n, &k); err != nil {
		return
	}

	currentRating := 0
	costs := make([]int, 0, n)

	for i := 0; i < n; i++ {
		var a int
		fmt.Fscan(in, &a)
		currentRating += a / 10
		rem := a % 10
		if rem != 0 {
			costs = append(costs, 10-rem)
		}
	}

	sort.Ints(costs)

	for _, c := range costs {
		if k >= c {
			k -= c
			currentRating++
		} else {
			break
		}
	}

	tens := k / 10
	maxAdditional := 10*n - currentRating
	if tens > maxAdditional {
		currentRating += maxAdditional
	} else {
		currentRating += tens
	}

	fmt.Println(currentRating)
}