【Codeforces 808 A. Straight «A»】
来源:互联网 发布:中世纪2优化9埃及 编辑:程序博客网 时间:2024/06/05 11:40
A. Straight «A»
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Noora is a student of one famous high school. It’s her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noora is studying, teachers are putting down marks to the online class register, which are integers from 1 to k. The worst mark is 1, the best is k. Mark that is going to the certificate, is calculated as an average of all the marks, rounded to the closest integer. If several answers are possible, rounding up is produced. For example, 7.3 is rounded to 7, but 7.5 and 7.8784 — to 8.
For instance, if Noora has marks [8, 9], then the mark to the certificate is 9, because the average is equal to 8.5 and rounded to 9, but if the marks are [8, 8, 9], Noora will have graduation certificate with 8.
To graduate with «A» certificate, Noora has to have mark k.
Noora got n marks in register this year. However, she is afraid that her marks are not enough to get final mark k. Noora decided to ask for help in the internet, where hacker Leha immediately responded to her request. He is ready to hack class register for Noora and to add Noora any number of additional marks from 1 to k. At the same time, Leha want his hack be unseen to everyone, so he decided to add as less as possible additional marks. Please help Leha to calculate the minimal number of marks he has to add, so that final Noora’s mark will become equal to k.
Input
The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 100) denoting the number of marks, received by Noora and the value of highest possible mark.
The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ k) denoting marks received by Noora before Leha’s hack.
Output
Print a single integer — minimal number of additional marks, that Leha has to add in order to change Noora’s final mark to k.
Examples
Input
2 10
8 9
Output
4
Input
3 5
4 4 4
Output
3
Note
Consider the first example testcase.
Maximal mark is 10, Noora received two marks — 8 and 9, so current final mark is 9. To fix it, Leha can add marks [10, 10, 10, 10] (4 marks in total) to the registry, achieving Noora having average mark equal to . Consequently, new final mark is 10. Less number of marks won’t fix the situation.
In the second example Leha can add [5, 5, 5] to the registry, so that making average mark equal to 4.5, which is enough to have 5 in the certificate.
若平均数 < k - 0.5,就继续 += k
AC代码:
#include<cstdio>int main(){ int n,k; scanf("%d %d",&n,&k); double ans = 0,a; for(int i = 1; i <= n; i++) scanf("%lf",&a),ans += a; int cut = 0; while(ans / n < k - 0.5) ans += k,n++,cut++; printf("%d\n",cut); return 0;}
- 【Codeforces 808 A. Straight «A»】
- codeforces 810A Straight «A»
- Codeforces 810A Straight «A» 题解
- Codeforces Round #415 (Div. 2) A. Straight «A»
- Codeforces Round #415 (Div. 2) A. Straight «A»
- A. Straight «A»
- CodeFroces 810A Straight «A»
- 810A. Straight «A»
- Codeforces Round #415 (Div. 2)A. Straight «A» (暴力)
- codeforces——810A——Straight «A»
- CodeForces 810A——Straight «A» ——二分
- Codeforces Round #415 A Straight <<A>>
- CodeForces 810A Straight <<A>> 【数学】【模拟】
- codeforces 810A Straight <<A>> 暴力
- 0526 CF#801A&G2n#D-Straight «A»
- CodeForces-a
- Codeforces 903A A
- Programming VIM/vSphere SDK with a straight way
- android 坐标系统
- java io
- 文件上传和下载
- CSS伪类的作用范围
- 如何抓住一只兔子?
- 【Codeforces 808 A. Straight «A»】
- printf(%s)的空指针问题
- 大神F2全网通刷机包 miui8 7.3.31 主题破解 自启管理 游戏加速 高级设置
- Spring 注解通过@Autowired,@Resource,@Qualifier,@PostConstruct,@PreDestroy注入属性详解
- 龙芯麒麟编译安装Ruby问题处理
- NSTimer与NSRunLoop
- Ubuntu下搭建VPN服务器
- Spring中@Resource、@Autowired、@Qualifier的注解注入及区别
- 高性能数据库之二 MySQL基准测试与MySQL设计