类似于poj2728那道题。详情请看
http://blog.csdn.net/wing_wuchen/article/details/74452401
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <math.h>
#include <queue>
#include <string.h>
typedef long long int lli;
using namespace std;
int n,k;
lli a[1010];
lli b[1010];
struct node{
int num;
double weight;
}d[1010];
bool cmp(const node&a,const node&b){
return a.weight < b.weight;
}
double rate(double r){
for(int i = 1;i <= n;i++){
d[i].num = i;
d[i].weight = b[i]*r-a[i];
}
double suma = 0,sumb = 0;
sort(d+1,d+1+n,cmp);
for(int i = 1;i <= n-k;i++){
suma += a[d[i].num];
sumb += b[d[i].num];
}
return suma/sumb;
}
int main(){
while(scanf("%d%d",&n,&k),n||k){
for(int i = 1;i <= n;i++){
scanf("%lld",a+i);
}
for(int i =1;i <= n;i++){
scanf("%lld",b+i);
}
double r = 0;
while(fabs(r - rate(r)) > 1e-6){
r = rate(r);
}
r *= 100;
int a = r,b = (r+1);
if( fabs(r - a) > fabs(r-b) ){
printf("%d\n",b);
}
else{
printf("%d\n",a);
}
//printf("%.1f\n",r);
}
}