Codeforces 581C - Developing Skills(贪心)
2017-07-21 14:20
387 查看
Description
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.
Examples
input
2 4
7 9
output
2
input
3 8
17 15 19
output
5
input
2 2
99 100
output
20
Solution
题目大意:有n个技能,k个技能点。技能对应的等级为a[i] i∈[0.n−1] ,任何一个技能,每达到10级,人物等级+1,技能最高100级。合理的加技能,求人物可以达到的最高等级是多少 ?
解题思路:
先将人物初始等级统计出来。
b[i]=a[i] mod 10
对 b[i] 进行升序排序,从高到低贪心求解。
k−10+b[i]>=0 ,则说明还可以继续加技能,继续向后执行。
人物最高等级为 n∗10 ,最终人物等级不能超过n∗10 .
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.
Examples
input
2 4
7 9
output
2
input
3 8
17 15 19
output
5
input
2 2
99 100
output
20
Solution
题目大意:有n个技能,k个技能点。技能对应的等级为a[i] i∈[0.n−1] ,任何一个技能,每达到10级,人物等级+1,技能最高100级。合理的加技能,求人物可以达到的最高等级是多少 ?
解题思路:
先将人物初始等级统计出来。
b[i]=a[i] mod 10
对 b[i] 进行升序排序,从高到低贪心求解。
k−10+b[i]>=0 ,则说明还可以继续加技能,继续向后执行。
人物最高等级为 n∗10 ,最终人物等级不能超过n∗10 .
#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; #define N 11111111 int a , b ; int main( ) { int n, k; while (~scanf("%d%d", &n, &k)) { int ans = 0; for (int i = 0; i < n; i++) { scanf("%d", &a[i]); ans += a[i] / 10; b[i] = a[i] % 10; } sort(b, b + n); for (int i = n - 1; i >= 0; i--) { if (k - 10 + b[i] >= 0) { ans++; k = k - 10 + b[i]; if (k >= 10 && i == 0) ans += k / 10; if (ans >= 10 * n) ans = 10 * n; } else break; } printf("%d\n", ans); } return 0; }
相关文章推荐
- CodeForces - 620C Pearls in a Row |set,贪心
- Codeforces 946E - Largest Beautiful Number(贪心、构造)
- Codeforces-372A Counting Kangaroos is Fun(贪心)
- 【codeforces 680 D】【数学+贪心+DFS】【求一个不超过 m 的最大体积 X, 每次选一个最大的 x 使得 x3 不超过当前剩余体积。问在能选最多个数的情况下,X 最大是多少】
- Codeforces 922 C - Robot Vacuum Cleaner (贪心、数据结构、sort中的cmp)
- codeforces 383 A. Milking cows【贪心 + 前缀和】
- codeforces - 870problem - C. Maximum splitting【贪心】
- Codeforces 373C:Counting Kangaroos is Fun(二分+贪心)
- CodeForces 702 A Maximum Increase (贪心,高效算法)
- CodeForces 731B-Coupons and Discounts(贪心 模拟)
- CodeForces 622E Ants in Leaves (贪心策略 递推公式)
- Codeforces-798C-Mike and gcd problem(贪心+数论)
- codeforces 472C Design Tutorial: Make It Nondeterministic 贪心
- Codeforces 509C. Sums of Digits 贪心枚举
- Codeforces_342B_Xenia and Spies(贪心)
- CodeForces 893D Credit Card (贪心)
- Codeforces 583 DIV2 GCD Table 贪心
- Codeforces 484A. Bits 贪心
- Codeforces 665C Simple Strings【暴力,贪心】
- Codeforces 18D Seller Bob (贪心)