CodeForces 581C Developing Skills

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 integerai
from 0 to 100. The higher the numberai is, the higher is thei-th skill of the character. The total rating
of the character is calculated as the sum of the values ​​of

for alli
from 1 to n. The expression⌊
x⌋ denotes the result of rounding the numberx
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 a4 = 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 ≤ 105,0 ≤ k ≤ 107)
— 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 integersai (0 ≤ ai ≤ 100),
whereai characterizes the level of thei-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 usingk or less improvement units.

Examples

Input

2 4
7 9

Output

2

Input

3 8
17 15 19

Output

5

Input

2 299 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

.

解题思路：最开始把这道题目想简单了，以为直接加和，再判一下会不会技能爆表就好，不过考虑这么一组数据（2 2 83 15），其实会出现进位的情况，所以还是要写的麻烦一些，把个位数从小到大排序，依次从大到小填充就好了，尽量让rating更高一些。

#include <iostream>
#include <algorithm>
#define Max 100005using namespace std;

int a[Max];
int b[Max];
int main()
{
int n,k,i,ans=0,total=0;
cin>>n>>k;
for(i=0;i<n;i++)
{
cin>>a[i];
ans += int(a[i]/10);
b[i] = a[i]%10;
total += a[i];
}
if(k+total>=100*n)
{
cout << 10*n << endl;
}
else
{
sort(b,b+n);
for(i=n-1;i>=0;i--)
{
if(k>=(10-b[i]))
{
ans++;
k -=(10-b[i]);
}
else
break;

}
cout << ans + int(k/10) << endl;
}

//cout << "Hello world!" << endl;
return 0;
}