01分数规划

比如题目想最大化这个，然后有最多k个i可以不取。那么我让这个东西>=mid，移项以后就是$si\ast ci-si\ast mid>=0$ ，每次二分check的时候，用数组存$si\ast ci-si\ast mid$的值，小到大排序，因为要求和大于等于0，所以从小到大，负的我有k次可以不取，正的全取。加入最后求和$si\ast ci-si\ast mid>=0$说明mid可以更大，让l=mid

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define de(a) cout<<#a<<' '<<a<<endl;
#define de2(a,b) cout<<#a<<' '<<a<<' '<<#b<<' '<<b<<endl;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define RAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define grand(l,r) uniform_int_distribution<int>(l,r)(rng)
#define IO ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define rep1(i, a) for (int i = 1; i <= (a); ++i)
inline ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
        f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
const double eps=1e-7;
const int N=1e5+10,M=405,mod=998244353;
ll qp(ll a,ll b)
{
    ll res=1;
    while(b)
    {
        if(b&1)res=res*a;
        b>>=1;
        a=a*a;
    }
    return res;
}
int n,k;
pii g[N];
double w[N];
bool check(double mid)
{
    for(int i=1;i<=n;i++)w[i]=g[i].fi*g[i].se-g[i].se*mid;
    sort(w+1,w+1+n);
    double sum=0;
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        if(w[i]>eps)
        {
            sum+=w[i];
        }
        else
        {
            if(cnt<k)
            {
                cnt++;
            }
            else sum+=w[i];
        }
    }
    
    return sum>=eps;
}
void solve()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)g[i].second=read();
    for(int i=1;i<=n;i++)g[i].first=read();
    sort(g+1,g+1+n);
    double l=0,r=1e11;
    while(r-l>eps)
    {
        double mid=(l+r)/2;
        if(check(mid))l=mid;
        else r=mid;
    }
    printf("%.11f",r);
}
int main()
{

    int t;
    //cin>>t;
    t=1;
    while(t--)
    {
        solve();
    }
    return 0;
}