Codeforces Round 415 (Div. 2)
A
Straight «A»
Codeforces
900
原题
←B →
翻译中…

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 $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ $(1 ≤ *a*_{*i*} ≤ *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*$.

翻译中…

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 image. 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.

翻译中…

样例

Input #1
2 10
8 9
Output #1
4
InputCopy OutputCopy
Input #2
3 5
4 4 4
Output #2
3
InputCopy OutputCopy
题目信息
题号
810A
时间限制
1 s
内存限制
256 MB
标签
模拟
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。