A10003 | Developing Skills
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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_{4}=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.
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_{4}=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.
输入格式
The first line of the input contains two positive integers $n$ and $k$ ( $1<=n<=10^{5}$ , $0<=k<=10^{7}$ ) — 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.
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.
输出格式
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.
输入输出样例
输入 #1
2 4 7 9
输出 #1
2
输入 #2
3 8 17 15 19
输出 #2
5
输入 #3
2 2 99 100
输出 #3
20
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 .
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 .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted