Codeforces 581C Developing Skills

C. Developing Skills

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 47 9

output

2

input

3 817 15 19

output

5

input

2 299 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 .

 1 #include<cstdio>
 2 #include<cmath>
 3 #include<queue>
 4 #include<algorithm>
 5 using namespace std;
 6
 7 struct node
 8 {
 9     int score;
10     int cost;
11     bool operator < (const node tmp)const
12     {
13         if(cost==tmp.cost)
14             return score>tmp.score;
15         return cost>tmp.cost;
16     }
17 };
18
19 int main()
20 {
21     int n,k;
22     while(scanf("%d%d",&n,&k)!=EOF)
23     {
24         int sum=0;
25         priority_queue<node>q;
26         for(int i=0;i<n;i++)
27         {
28             int tmp;
29             node e;
30             scanf("%d",&tmp);
31             e.score=tmp/10;
32             e.cost=((int)((tmp+10)*1.0/10))*10-tmp;
33             q.push(e);
34         }
35         while(1)
36         {
37             node e=q.top();
38             if(k>=e.cost&&e.score<10)
39             {
40                 q.pop();
41                 k-=e.cost;
42                 q.push((node){e.score+1,10});
43             }
44             else break;
45         }
46         while(!q.empty())
47         {
48             sum+=q.top().score;
49             q.pop();
50         }
51         printf("%d\n",sum);
52     }
53     return 0;
54 }
时间: 2024-10-17 19:56:55

Codeforces 581C Developing Skills的相关文章

cf581C Developing Skills

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 numberai is, the higher is t

[CodeForces - 614D] D - Skills

D - Skills Lesha plays the recently published new version of the legendary game hacknet. In this version character skill mechanism was introduced. Now, each player character has exactly n skills. Each skill is represented by a non-negative integer ai

【Henu ACM Round#19 C】 Developing Skills

[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 优先把不是10的倍数的变成10的倍数. (优先%10比较大的数字增加 如果k还有剩余. 剩下的数字都是10的倍数了. 那么先加哪一个都可以了. [代码] #include <bits/stdc++.h> using namespace std; const int N = 1e5; int a[N+10],n,k; int b[N+10]; int point = 0; int main() { ios::sync_with_

寒假第二周 1.18 --- 1.24

1.18 cf 581c 581C - Developing Skills 重新自己写了一遍,注意都是0 的时候 1 #include<cstdio> 2 #include<cstring> 3 #include<iostream> 4 #include<algorithm> 5 #include<vector> 6 using namespace std; 7 8 const int maxn = 1e5+5; 9 int n,k; 10 11

2017-5-7-Train: Codeforces Round #322 (Div. 2)

A. Vasya the Hipster(水题) One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and b blue socks. According to the latest fashion, hipsters should wear the socks of different colors: a red one on the l

Codeforces Round #222 (Div. 1) D. Developing Game 线段树有效区间合并

D. Developing Game Pavel is going to make a game of his dream. However, he knows that he can't make it on his own so he founded a development company and hired n workers of staff. Now he wants to pick n workers from the staff who will be directly res

CodeForces 614D Skills

排序+枚举+二分 最大的那些变成A,小的那部分提高最小值 #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; const int maxn=100000+10; int n; long long A,cf,cm,m; struct X { long long a; long long ans; int id; } s[maxn]

10 Skills Every SharePoint Developer Needs

10 Skills Every SharePoint Developer Needs(原文) This blog post guides you through the essential skills for a successful SharePoint developer. Great SharePoint developers know how to use scripting, design, and drafting tools. They have knowledge of out

CodeForces 42A Guilty — to the kitchen!

Guilty — to the kitchen! Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 42A Description It's a very unfortunate day for Volodya today. He got bad mark in algebra and was therefore force