CF68B.Energy exchange

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

It is well known that the planet suffers from the energy crisis. Little Petya doesn't like that and wants to save the world. For this purpose he needs every accumulator to contain the same amount of energy. Initially every accumulator has some amount of energy: the ii -th accumulator has aia_{i} units of energy. Energy can be transferred from one accumulator to the other. Every time xx units of energy are transferred ( xx is not necessarily an integer) kk percent of it is lost. That is, if xx units were transferred from one accumulator to the other, amount of energy in the first one decreased by xx units and in other increased by units.

Your task is to help Petya find what maximum equal amount of energy can be stored in each accumulator after the transfers.

输入格式

First line of the input contains two integers nn and kk ( 1<=n<=10000,0<=k<=991<=n<=10000,0<=k<=99 ) — number of accumulators and the percent of energy that is lost during transfers.

Next line contains nn integers a1,a2,... ,ana_{1},a_{2},...\ ,a_{n} — amounts of energy in the first, second, .., nn -th accumulator respectively ( 0<=ai<=1000,1<=i<=n0<=a_{i}<=1000,1<=i<=n ).

输出格式

Output maximum possible amount of energy that can remain in each of accumulators after the transfers of energy.

The absolute or relative error in the answer should not exceed 10610^{-6} .

输入输出样例

  • 输入#1

    3 50
    4 2 1
    

    输出#1

    2.000000000
    
  • 输入#2

    2 90
    1 11
    

    输出#2

    1.909090909
    
首页