Dropping tests

01分数规划
传送门

ai/bi=k f()=ai-kbi 若k增大 f()减少 若k减少f()增大二分查找

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
#define in(x) scanf("%d",&x)
#define onword(n,arr) \
for(int i=0;i<n;i++) \
in(arr[i]);
#define fool EOF
#define hear(x) printf("%f ",x);
#define escape ' '
double arr3[10001];
void specialin(int *arr1,int *arr2,double k,int n){
for(int i=0;i<n;i++)
arr3[i]=arr1[i]*1.0-k*arr2[i];
}
typedef double fly;
#define equal 1e-7
#define when while
int oh[10001];
int oa[10001];
void  show(double *arr,int n)  {
for(int i=0;i<n;i++)
hear(arr[i]);
printf("\n");
}

#define debug()
#ifdef ebug
printf("________________________T_____________T_________________________\n"); \
#else 0
#endif // 0
void quicksortd( double* be, double * ed)//快速搜索
{


    if(be>=ed)return ;
    double *l=be,*r=ed;
    while(l<r)
    {
        while(l<r&&*l>*r)l++;
        if(l<r)
        {
            swap(*l,*r);
            r--;
        }
        while(l<r&&*l>*r)r--;
        if(l<r)
        {
            swap(*l,*r);
            l++;
        }
    }
    quicksortd(be,l-1);
    quicksortd(l+1,ed);
}
bool judge(double *arr,int n,int y)
{
    quicksortd(arr,arr+n-1);
    double sum=0;
    for(int i=0;i<y;i++)
        sum+=arr[i];
    return sum>0;
}
int x,y;

int main()
{
    when(in(x)&&in(y),x||y)
    {
        onword(x,oh);
        onword(x,oa);
    fly l=0,r=1.0;
    y=x-y;
    when(r-l>=equal)
    {
        fly mid=(l+r)/2.0;
        specialin(oh,oa,mid,x);
        if(judge(arr3,x,y))l=mid;//>0说明k取小了
        else r=mid;//说明k取大了
    }
    printf("%d\n",int((r+0.005)*100));
    }


}