POJ--2976--最大化平均值

In a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be

                                                                               .

Given your test scores and a positive integer k, determine how high you can make your cumulative average if you are allowed to drop any k of your test scores.

Suppose you take 3 tests with scores of 5/5, 0/1, and 2/6. Without dropping any tests, your cumulative average is . However, if you drop the third test, your cumulative average becomes .

Input

The input test file will contain multiple test cases, each containing exactly three lines. The first line contains two integers, 1 ≤ n ≤ 1000 and 0 ≤ k < n. The second line contains n integers indicating ai for all i. The third line contains n positive integers indicating bi for all i. It is guaranteed that 0 ≤ ai ≤ bi ≤ 1, 000, 000, 000. The end-of-file is marked by a test case with n = k = 0 and should not be processed.

Output

For each test case, write a single line with the highest cumulative average possible after dropping k of the given test scores. The average should be rounded to the nearest integer.

Sample Input
3 1
5 0 2
5 1 6
4 2
1 2 7 9
5 6 7 9
0 0
Sample Output
83
100
Hint

To avoid ambiguities due to rounding errors, the judge tests have been constructed so that all answers are at least 0.001 away from a decision boundary (i.e., you can assume that the average is never 83.4997).

思路：最大化平均值问题; a[i]/E b[i]>=x----->>>E a[i]-x*b[i]>=0----->>其中E表示求和；

对于c[i]=a[i]-x*b[i],进行排序，贪心地选取训要的元素；返回bool类型sum>=0;

注意：数据类型：long long int ///double 注意正确设置；

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int inf=0x3f3f3f;
int n,m;
long long int a[1010],b[1010];
double c[1010];
bool check(double x){//最大化平均值 
	for(int i=0;i<n;i++){
		c[i]=a[i]-x*b[i]; 
	}
	sort(c,c+n);
	double sum=0;
	for(int i=0;i<n-m;i++){
		sum+=c[n-i-1];
	}
	return sum>=0;
}
int main(){
	while(scanf("%d%d",&n,&m)!=EOF){
		if(n==0&&m==0)
			break;
		for(int i=0;i<n;i++)
			scanf("%lld",&a[i]);
		for(int i=0;i<n;i++)
			scanf("%lld",&b[i]);
		double mina,mid,maxa;
		mina=0.0,maxa=1.0*inf;
		for(int i=1;i<=100;i++){
			mid=(maxa+mina)/2;
			if(check(mid))
				mina=mid;
			else
				maxa=mid;
		}
		printf("%.0f\n",maxa*100);
	} 
	return 0;
}