A8160. Energy exchange
编程题
普及/提高-
知识点
题目描述
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.
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 $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$ ).
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$ ).
输出格式
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}$ .
The absolute or relative error in the answer should not exceed $10^{-6}$ .
输入输出样例
输入 #1
3 50 4 2 1
输出 #1
2.000000000
输入 #2
2 90 1 11
输出 #2
1.909090909