poj 2976（01分数规划

/*
* @author:  Cwind
* http://www.cnblogs.com/Cw-trip/
* 蒟蒻只能做几个水题。。
*/
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <cmath>
using namespace std;
#define IOS std::ios::sync_with_stdio (false);std::cin.tie(0)
#define pb push_back
#define PB pop_back
#define bk back()
#define fs first
#define se second
#define sq(x) (x)*(x)
#define eps (1e-3)
#define IINF (1<<29)
#define LINF (1ll<<59)
#define FINF (1e100)
#define INF 1000000000
const double pi=acos(-1.0);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> P;

const int maxn=1005;
int n,k;
double a[maxn],b[maxn];
double c[maxn];
bool check(double p){
    for(int i=0;i<n;i++){
        c[i]=a[i]-p*b[i];
    }
    sort(c,c+n,greater<double>());
    double sum=0;
    for(int i=0;i<n-k;i++){
        sum+=c[i];
    }
    if(sum<0) return 0;
    else return 1;
}
int main(){
    freopen("/home/files/CppFiles/in","r",stdin);
    while(cin>>n>>k){
        if(n==0&&k==0) break;
        for(int i=0;i<n;i++){
            scanf("%lf",&a[i]);
            a[i]*=100;
        }
        for(int i=0;i<n;i++){
            scanf("%lf",&b[i]);
        }
        double l=0,r=100;
        while(r-l>eps){
            double mid=(r+l)/2;
            if(check(mid)){
                l=mid;
            }else{
                r=mid;
            }
        }
        printf("%.0f\n",l);
    }
    return 0;
}