CodeForces 810A Straight <<A>> 【数学】【模拟】

题目链接： Codeforces Round #415 (Div. 2) A

Description：
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.

题目大意：
告诉你n个数代表Noora所得的n个分数，分数的范围在1~k内，最终评定的分数为Noora所有的分数的平均值四舍五入后的结果。
现Noora可以加上1~k内的任意分数，问最少加多少次能使他的最终得分达到k。

解题思路：
既然可以加1~k内的任意分数并且求最少次数，肯定是每次都加k了。然后模拟计算即可。

Mycode：

#include <bits/stdc++.h>
using namespace std;
const int MAX = 1005;

int main()
{
    int n, m, tem;
    cin >> n >> m;
    int tot = 0;
    int sum = 0;
    double ave = 0;
    for(int i = 0; i < n; ++i)
    {
        cin >> tem;
        tot++;
        sum += tem;
    }
    //cout << tot << "  " << sum << endl;
    while(1)
    {
        ave = (double)sum / tot;
        if(ave >= m) break;
        if(ave-(int)ave >= 0.5)
        {
            if(ave+1 >= m) break;
        }
        tot++;
        sum += m;
    }
    cout << tot-n << endl;
    return 0;
}