#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BM(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T mdINV(T a, T M) {
  return BM(a, M - 2, M);
}
template <class T>
inline T PW(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
template <class T>
string NTS(T Number) {
  stringstream ss;
  ss << Number;
  return ss.str();
}
template <class T>
T stringtonumber(const string &Text) {
  istringstream ss(Text);
  T result;
  return ss >> result ? result : 0;
}
template <class T>
bool ISLEFT(T a, T b, T c) {
  if (((a.first.first - b.first.first) * (b.second.second - c.second.second) -
       (b.first.first - c.first.first) * (a.second.second - b.second.second)) <
      0.0)
    return 1;
  else
    return 0;
}
int n, a[100004], m;
vector<int> v[100000 + 2];
int ans = 0;
void dfs(int i, int p, int cnt, bool fl) {
  if (a[i] == 1 && a[p] == 1)
    cnt++;
  else if (a[i] == 1)
    cnt = 1;
  if (cnt > m) fl = 1;
  bool fl1 = 0;
  for (int j = 0; j < v[i].size(); j++) {
    int first = v[i][j];
    if (first == p) continue;
    fl1 = 1;
    dfs(first, i, cnt, fl);
  }
  if (fl1 == 0 && fl == 0) ans++;
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  pair<int, int> a[n + 2];
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].second);
    for (int j = 0; j <= 9; j++) {
      if ((a[i].second + j) % 10 == 0) {
        a[i].first = j;
        break;
      }
    }
  }
  sort(a + 1, a + n + 1);
  int res = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i].first <= m) {
      a[i].second += a[i].first;
      m -= a[i].first;
    }
    res += a[i].second / 10;
  }
  for (int j = 1; j <= n; j++) {
    int first = m / 10;
    int second = (100 - a[j].second) / 10;
    first = min(first, second);
    res += first;
    m -= first * 10;
  }
  printf("%d\n", res);
  return 0;
}
