###### 【poj 2976】 Dropping tests 二分（分数优化）

Dropping tests

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9121 Accepted: 3194

Description

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).

Source

#include<iostream>
#include<queue>
#include<cmath>
#include<stdio.h>
#include<algorithm>
using namespace std;

int n,k;
double a[1005],b[1005];
double y[1005];
double cmp(double a,double b)
{
return a>b;
}
bool C(double x)
{

double tmp=0;
for(int i=1;i<=n;i++)
{
y[i]=a[i]-x*b[i];
}
sort(y+1,y+1+n,cmp);
for(int i=1;i<=k;i++)
{
tmp+=y[i];
}

if(tmp>=0) return 1;
return 0;

}
void solve()
{
double l=0,r=1.0,mid;
for(int i=0;i<100;i++)
{
mid=(l+r)/2;
if(C(mid))
{
l=mid;
}else  r=mid;
}

printf("%.0lf\n",(double)mid*100.0);
}

int main()
{
while(scanf("%d%d",&n,&k)!=EOF)
{
if(!n&&!k) return 0;
for(int i=1;i<=n;i++)
{
scanf("%lf",&a[i]);
}

for(int j=1;j<=n;j++)
scanf("%lf",&b[j]);
k=n-k;
solve();
}
return 0;
}

#### poj Dropping tests

2016-07-20 23:08:34

#### d/ F - Dropping test.（ai+加和 bi+ n k 求最小分数）

2017-03-13 10:38:20

#### Poj 2976 Dropping tests（01分数规划 牛顿迭代）

2017-02-04 18:48:04

#### POJ2976-Dropping tests

2017-05-17 22:51:53

#### Dropping tests--计算方法，01分数规划

2016-12-01 14:15:48

#### poj 2976(01分数规划搜索+二分答案)

2012-07-02 17:25:48

#### poj2976

2013-10-04 11:04:29

#### POJ2976 Dropping tests (分数规划)

2015-08-05 16:55:12

#### POJ - 2976 Dropping tests 二分 最大化平均值

2017-07-26 17:53:12

#### POJ 2976-Dropping tests(01分数规划_二分||Dinkelbach算法)

2015-08-10 15:00:58

## 不良信息举报

【poj 2976】 Dropping tests 二分（分数优化）