CF68B.Energy exchange
普及/提高-
通过率:0%
时间限制:2.00s
内存限制:256MB
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 i-th accumulator has a__i units of energy. Energy can be transferred from one accumulator to the other. Every time x units of energy are transferred (x is not necessarily an integer) k percent of it is lost. That is, if x units were transferred from one accumulator to the other, amount of energy in the first one decreased by x 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.
众所周知,地球正面临能源危机。小佩佳对此深感不满,希望拯救世界。为此,他需要让每个蓄电池储存相同数量的能源。最初,每个蓄电池都储存有一定量的能源:第 i 个蓄电池含有 ai 单位能源。能源可以在蓄电池之间转移。每次转移 x 单位能源(x 不必为整数)时,会有 k% 的能量损耗。也就是说,若从一个蓄电池向另一个蓄电池转移 x 单位能源,则前者的能源减少 x 单位,而后者的能源增加
单位。
你的任务是帮助佩佳找出:经过若干次转移后,每个蓄电池所能储存的最大相等能源量是多少。
输入格式
First line of the input contains two integers n and k (1 ≤ n ≤ 10000, 0 ≤ k ≤ 99) — number of accumulators and the percent of energy that is lost during transfers.
Next line contains n integers _a_1, _a_2, ... , a__n — amounts of energy in the first, second, .., n-th accumulator respectively (0 ≤ a__i ≤ 1000, 1 ≤ i ≤ n).
输入的第一行包含两个整数 n 和 k(1 ≤ n ≤ 10000,0 ≤ k ≤ 99)—— 分别表示蓄能器的数量以及能量在传输过程中损失的百分比。
第二行包含 n 个整数 a1, a2, …, an —— 分别表示第 1、第 2、……、第 n 个蓄能器中的能量值(0 ≤ ai ≤ 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 10 - 6.
输出能量转移后每个蓄电池中可能剩余的最大能量值。
答案的绝对或相对误差不应超过 10−6。
输入输出样例
输入#1
3 50 4 2 1
输出#1
2.000000000
输入#2
2 90 1 11
输出#2
1.909090909
输入解题思路,AI测评打分。不知道怎么写?