codeforces 581C Developing Skills
来源:互联网 发布:手淘宝网 编辑:程序博客网 时间:2024/05/23 13:56
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个技能和m个技能点,以及n个技能的等级。战力等于所有的技能等级除以10相加之和,问,问么分配这些技能点,可以使得战力最大,输出最大战力。
解题思路:优先分配给接近可以被10整除的等级的技能。注意,技能等级上限100级。
#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <cstdlib>using namespace std;typedef long long ll;const int N = 1e5 + 5;int n, m;int num[N];int cmp(int a, int b) { int A = a % 10; int B = b % 10; return A > B;}int main() { while (scanf("%d %d", &n, &m) == 2) { for (int i = 0; i < n; i++) { scanf("%d", &num[i]); } sort(num, num + n, cmp); while (m > 0) { for (int i = 0; i < n; i++) { int temp = 10 - (num[i] % 10); if (m >= temp) { m -= temp; num[i] += temp; } else { m = 0; num[i] += m; } } } int sum = 0; for (int i = 0; i < n; i++) { sum += num[i] / 10; } printf("%d\n", sum); } return 0;}
- Codeforces 581C Developing Skills
- codeforces 581C Developing Skills
- codeforces 581C Developing Skills
- CodeForces 581C Developing Skills
- Codeforces-581C-Developing Skills
- Codeforces 581C Developing Skills 贪心
- CodeForces 581C - Developing Skills(模拟)
- codeforces 581-C. Developing Skills(贪心)
- 解题报告 之 CodeForces 581C Developing Skills
- CF 581C Developing Skills
- coderforce 581C. Developing Skills
- Codeforces Round #322 C Developing Skills
- codefoces 581C Developing Skills(贪心)
- Codeforces Round #322 (Div. 2)C. Developing Skills
- Codeforces Round #322 (Div. 2)C. Developing Skills
- cf 591 C. Developing Skills
- Code Forces 581 C. Developing Skills(贪心)
- Developing Skills
- LeetCode -- Single Number
- 十步完全理解SQL
- 图像平滑处理
- 现在广告都可以收藏了
- Linux命令 grep
- codeforces 581C Developing Skills
- 类似于小球一样的,下弹 在跳起来的功能
- 黑马程序员——Java语言--面向对象(二)
- 语音识别置信度
- java反射机制详解 及 Method.invoke解释
- 使用Json解析Json数据
- Spring Boot实践应用开发(6)
- 编码解码模型中编码方案的确定策略
- 静态页面和动态页面