百度一波01分数规划。
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5+55;
struct node
{
int s,c;
double d;
bool friend operator < (node a,node b)
{return a.d>b.d;}
}a[N];
int n,k;
bool check(double x)
{
for(int i=1;i<=n;i++)
a[i].d=a[i].s*a[i].c-x*a[i].s;
sort(a+1,a+1+n);
double ans=0;
for(int i=1;i<=n-k;i++){
ans+=a[i].d;
}
return ans>0;
}
int main()
{
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&a[i].s);
for(int i=1;i<=n;i++)
scanf("%d",&a[i].c);
double l=0,r=1000;
while(r-l>1e-8){
double mid=(l+r)/2;
if(check(mid))
l=mid;
else
r=mid;
}
printf("%.8lf",l);
return 0;
}