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 ai 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 xunits 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.
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 a1, a2, ... , an — amounts of energy in the first, second, .., n-th accumulator respectively (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.
3 50 4 2 1
2.000000000
2 90 1 11
1.909090909
不论最后如何转移最后剩余的电量肯定会再电量的最小值和最大值之间。所以我们会想到二分这个最终电量,直到l和r的差值小到可以忽略。
#include <bits/stdc++.h>
#define exp 1e-7
using namespace std;
int n,k;
double l=1005,r=-1,a[10105];
int judge(double mid){
double sum1=0,sum2=0;
for(int i=0;i<n;i++){
if(a[i]<mid){
sum1=sum1+(mid-a[i])/(1.0-k/100.0);
}
else{
sum2=sum2+a[i]-mid;
}
}
if(sum1>sum2)
return 0;
else
return 1;
}
int main()
{
while(scanf("%d%d",&n,&k)!=EOF){
for(int i=0;i<n;i++){
scanf("%lf",&a[i]);
if(a[i]>r)
r=a[i];
if(a[i]<l)
l=a[i];
}
double mid=(l+r)/2.0;
while(l+exp<=r){
mid=(l+r)/2.0;
if(judge(mid))
l=mid;
else
r=mid;
}
printf("%.9lf\n",mid);
}
return 0;
}