codeforces 581C Developing Skills

题目链接：http://codeforces.com/contest/581/problem/C 

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.

Examples

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个数，每个数ai不会超过100，再给你一个数 k；让你计算通过把k分解到每一个ai上（ai不超过100；不一定要把k分完，也不一定是均分，只要最后结果最大就行）使得最后答案求和ai/10的值最大；

思路：首先对那个数按照末尾数字进行从大到小排序依次，接着对每一个数字进行填补，补成距离它最近的整数，然后判断k是否为0；不为0的话就把一个数一个数的增加到最大，但每个数不能超过100，直到k为0；最后直接算答案。

代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

int n,k;
struct point {
    int x;
    int s;
    bool operator < (const point &a) const {
        return s > a.s;
    }
} p[100005];

int main() {
    cin >> n >> k;
    for(int i = 0; i < n; i++) {
        cin >> p[i].x;
        p[i].s = p[i].x%10;
    }
    sort(p,p+n);
    for(int i = 0; i <n; i++) {
        if(p[i].s == 9 && k >= 1) {
            p[i].x += 1;
            k -= 1;
        }
        if(p[i].s == 8&& k >= 2) {
            p[i].x += 2;
            k -= 2;
        }
        if(p[i].s == 7&& k >= 3) {
            p[i].x += 3;
            k -= 3;
        }
        if(p[i].s == 6&& k >= 4) {
            p[i].x += 4;
            k -= 4;
        }
        if(p[i].s == 5&& k >= 5) {
            p[i].x += 5;
            k -= 5;
        }
        if(p[i].s == 4&& k >= 6) {
            p[i].x += 6;
            k -= 6;
        }
        if(p[i].s == 3&& k >= 7) {
            p[i].x += 7;
            k -= 7;
        }
        if(p[i].s == 2 && k >= 8) {
            p[i].x += 8;
            k -= 8;
        }
        if(p[i].s == 1 && k >= 9) {
            p[i].x += 9;
            k -= 9;
        }
    }
    int tag = 0;
    if(k != 0) {
        for(int i = 0;i < n && k > 0;i++){//忘记了填补贡献WA
            if(p[i].x+k <= 100){
                p[i].x = p[i].x+k;
                k = 0;
            }else{
                k -= (100-p[i].x);
                p[i].x = 100;
            }
        }
        for(int i = 0; i < n; i++) {
            tag += p[i].x/10;

        }
    } else {
        for(int i = 0; i < n; i++) {
            tag += p[i].x/10;
        }
    }
   cout << tag << endl;
    return 0;
}

简单题却还是写了好久，写代码之前一定要想清楚，不然写的时候乱的慌