Codeforces Round #322 (Div. 2)C. 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 integer ai from 0 to 100. The higher the number ai 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 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 integers ai (0 ≤ ai ≤ 100), where ai 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，每个数上限为100，问max sum (a[i] / 10)

这题用贪心

优先把最接近下一个十整数的a[i]加到下一个十整数，然后对每一个a[i]加10，直到a[i]等于100或k<=0.

具体看代码。

#include
         
         
          
          
#include
          
          
           
           
#include
           
           
            
            
#include
            
            
             
             
using namespace std;

const int N = 100001;
struct node
{
    int val;
    int m;
} a[N];

bool cm(node x, node y)
{
    return x.val > y.val;
}

bool cmp(node x, node y)
{
    return x.m < y.m;
}

void debug(int n)
{
    for(int i = 0; i < n; i++)
        printf("%d ", a[i].val);
    printf("\n");
}

int main(void)
{
    int n, k;
    while(~scanf("%d%d", &n, &k))
    {
        int i, j;
        int ans = 0;
        for(i = 0; i < n; i++)
        {
            scanf("%d", &a[i].val);
            a[i].m = a[i].val/10;
            a[i].val %= 10;
        }
        sort(a, a+n, cm);
//        debug(n);
        int flag= 0;
        for(i = 0; i < n && k; i++)
        {
            if(10 - a[i].val <= k)
            {
                if(a[i].m < 10)
                {
                    k -= 10-a[i].val;
                    a[i].val = 0;
                    a[i].m++;
                }

            }
            else
            {
                flag = 1;
                break;
            }
        }
        if(!flag && k)
        {
            k /= 10;
            sort(a, a+n, cmp);
            for(i = 0; i < n && k; i++)
            {
                if(10 > a[i].m)
                {
                    if(10 - a[i].m < k)
                    {
                        k -= 10-a[i].m;
                        a[i].m = 10;
                    }
                    else
                    {
                        a[i].m += k;
                        k = 0;
                        break;
                    }
                }
            }
        }
        for(i = 0; i < n; i++)
            ans += a[i].m;
        printf("%d\n", ans);
    }
    return 0;
}