Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i].
At the university where she attended, the final score of her is
Now she can delete at most k courses and she want to know what the highest final score that can get.
输入描述:
The first line has two positive integers n,k The second line has n positive integers s[i] The third line has n positive integers c[i]
输出描述:
Output the highest final score, your answer is correct if and only if the absolute error with the standard answer is no more than 10-5
备注:
1≤ n≤ 105 0≤ k < n 1≤ s[i],c[i] ≤ 103
示例1
输入
3 1 1 2 3 3 2 1
输出
2.33333333333
说明
Delete the third course and the final score is
最大化平均值是挑战上的一个题改编来的:p144页;里面有详细的证明过程,在这里稍微修改了一下:
代码如下:
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
const int N=100000+10,D=(int)1e9+10;
const double eps=1e-6;
int n,k;
double a[N],b[N],d[N];
bool cmp(int x,int y) {return x>y;}
int main()
{
scanf("%d%d",&n,&k);
for (int i=1;i<=n;i++) scanf("%lf",&b[i]);
for (int i=1;i<=n;i++){
scanf("%lf",&a[i]);
a[i] = a[i]*b[i];}
double l,r,mid=0.0000000,h;
for (int i=1;i<=n;i++)
if (a[i]/b[i]>mid) mid=a[i]/b[i];
l=0.0000000,r=mid;
while (r-l>eps){
mid=(l+r)/2, h=0;
for (int i=1;i<=n;i++)
d[i]=a[i]-b[i]*mid;
sort(d+1,d+1+n,cmp);
for (int i=1;i<=n-k;i++)
h+=d[i];
if (h>=0.0000000) l=mid;
else r=mid-eps;
}
printf("%.6f\n",r);
return 0;
}