题目:
分析:
01 01 01分数规划裸题( y i d o n g yidong yidong说得好:)逃
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
using namespace std;
inline LL read(){
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
double d[100005],maxx;
int x[100005],y[100005];
bool cmp(double a,double b)
{
return a>b;
}
int main()
{
int n=read(),m=read();
for(int i=1;i<=n;i++) x[i]=read();
maxx=0;
for(int i=1;i<=n;i++)
{
y[i]=read();
if(maxx<x[i]/y[i]) maxx=x[i]/y[i];
}
double l=0,r=maxx;
while(abs(r-l)>=0.0001)
{
double mid=(l+r+0.0001)/2;
for(int i=1;i<=n;i++) d[i]=x[i]-mid*y[i];
sort(d+1,d+1+n,cmp);
double sum=0;
for(int i=1;i<=m;i++) sum+=d[i];
if(sum>=0) l=mid; else r=mid-0.0001;
}
printf("%.3lf",l);
return 0;
}