C. Developing Skills （CF Round #322 (Div.2) 贪心）

C. Developing Skills

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya loves computer games. Finally a game that he's been waiting for so long came out!

The main character of this game has n different skills, each of which is characterized by an integer a_i from 0 to 100. The higher the number a_i is, the higher is the i-th skill of the character. The total rating of the character is calculated as the sum of the values ​​of for all i from 1 to n. The expression ⌊ x⌋ denotes the result of rounding the number x down to the nearest integer.

At the beginning of the game Petya got k improvement units as a bonus that he can use to increase the skills of his character and his total rating. One improvement unit can increase any skill of Petya's character by exactly one. For example, if a₄ = 46, after using one imporvement unit to this skill, it becomes equal to 47. A hero's skill cannot rise higher more than 100. Thus, it is permissible that some of the units will remain unused.

Your task is to determine the optimal way of using the improvement units so as to maximize the overall rating of the character. It is not necessary to use all the improvement units.

Input

The first line of the input contains two positive integers n and k (1 ≤ n ≤ 10⁵, 0 ≤ k ≤ 10⁷) — the number of skills of the character and the number of units of improvements at Petya's disposal.

The second line of the input contains a sequence of n integers a_i (0 ≤ a_i ≤ 100), where a_i characterizes the level of the i-th skill of the character.

Output

The first line of the output should contain a single non-negative integer — the maximum total rating of the character that Petya can get using k or less improvement units.

Sample test(s)

Input

2 4
7 9

Output

2

Input

3 8
17 15 19

Output

5

Input

2 2
99 100

Output

20

Note

In the first test case the optimal strategy is as follows. Petya has to improve the first skill to 10 by spending 3 improvement units, and the second skill to 10, by spending one improvement unit. Thus, Petya spends all his improvement units and the total rating of the character becomes equal to lfloor frac{100}{10} rfloor +  lfloor frac{100}{10} rfloor = 10 + 10 =  20.

In the second test the optimal strategy for Petya is to improve the first skill to 20 (by spending 3 improvement units) and to improve the third skill to 20 (in this case by spending 1 improvement units). Thus, Petya is left with 4 improvement units and he will be able to increase the second skill to 19 (which does not change the overall rating, so Petya does not necessarily have to do it). Therefore, the highest possible total rating in this example is .

In the third test case the optimal strategy for Petya is to increase the first skill to 100 by spending 1 improvement unit. Thereafter, both skills of the character will be equal to 100, so Petya will not be able to spend the remaining improvement unit. So the answer is equal to . 

题意：给出n个数，还有一个数k，用k去补这n个数，使得ai/10之和最大。

思路：贪心。先把n个数按照x值从小到大排序，其中x等于 把ai变为10的倍数所需要要添加的最小值；然后用k尽量去把每个数按照x值填为10的倍数，如果k还有剩余尽量填就行了。具体看代码。

代码：

#include <iostream>
#include <functional>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define eps 1e-6
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FRE(i,a,b)  for(i = a; i <= b; i++)
#define FREE(i,a,b) for(i = a; i >= b; i--)
#define FRL(i,a,b)  for(i = a; i < b; i++)
#define FRLL(i,a,b) for(i = a; i > b; i--)
#define mem(t, v)   memset ((t) , v, sizeof(t))
#define sf(n)       scanf("%d", &n)
#define sff(a,b)    scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define pf          printf
#define DBG         pf("Hi\n")
typedef __int64 ll;
using namespace std;
#define INF 0x3f3f3f3f
#define N 100010

struct Node
{
    int v,x;
}node[N];

int n,k;

int cmp(Node a,Node b)
{
    return a.x<b.x;
}

int main()
{
    int i,j,w;
    while (~scanf("%d%d",&n,&k))
    {
        for (i=0;i<n;i++)
        {
            scanf("%d",&node[i].v);
            if (node[i].v%10==0) w=0;
            else w=(node[i].v/10+1)*10-node[i].v;
            node[i].x=w;
        }
        sort(node,node+n,cmp);
        for (i=0;i<n;i++)
        {
            if (node[i].x==0) continue;
            int r=min(k,node[i].x);
            node[i].v+=r;
            k-=r;
            if (k==0) break;
        }
        if (k/10!=0)
        {
            for (i=0;i<n;i++)
            {
                if (node[i].v==100) continue;
                int r=min(100-node[i].v,k);
                node[i].v+=r;
                k-=r;
                if (k/10==0) break;
            }
        }
        int ans=0;
        for (i=0;i<n;i++)
        {
            ans+=(node[i].v/10);
        }
        printf("%d\n",ans);
    }
    return 0;
}
/*
5
1 2 3 1 2
4
3 2 1 4
*/