Dropping tests POJ 2976 二分

Dropping tests POJ 2976 二分

传送门：http://poj.org/problem?id=2976

Description
In a certain course, you take $n$ tests. If you get $a_i$ out of bi questions correct on test $i$, your cumulative average is defined to be
$$100\ast \begin{array}{c}\underline{{\sum }_{i=1}^n{a}_i}\\ {\sum }_{i=1}^n{b}_i\end{array}$$
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 $100\ast \begin{array}{c}\underline{5+0+2}\\ 5+1+6\end{array}=50$. However, if you drop the third test, your cumulative average becomes $100\ast \begin{array}{c}\underline{5+0}\\ 5+1\end{array}\approx 83.33\approx 83$.

Input
The input test file will contain multiple test cases, each containing exactly three lines. The first line contains two integers, $1\le n\le 1000$ and $0\le k<n$. The second line contains $n$ integers indicating $a_i$ for all $i$. The third line contains $n$ positive integers indicating $b_i$ for all $i$. It is guaranteed that $0\le a_i\le b_i\le 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	Sample Output
3 1 5 0 2 5 1 6 4 2 1 2 7 9 5 6 7 9 0 0	1 2

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

题意：给出一个$n$和一个$k$，$n$表示有$n$组$a$,$b$,每组$a$,$b$相互配对，第$i$组表示为$a[i]$，$b[i]$。$k$表示我们需要在这$n$组$a$,$b$之间删除$k$组。现问用最优的删除方式能够达到的$100\ast \begin{array}{c}\underline{{\sum }_{i=1}^n{a}_i}\\ {\sum }_{i=1}^n{b}_i\end{array}$的最大值是多少。

思路：首先，我们假设x为小于等于最大答案的合法答案,则x应该满足，
$$x<=100\ast \begin{array}{c}\underline{{\sum }_{i=1}^n{a}_i}\\ {\sum }_{i=1}^n{b}_i\end{array}=s①$$

且$$f(x)=(x<=s?1:0)$$具有单调性，所以可以二分找答案。
即①式等于 $$x\ast （\sum _{i=1}^n{b}_i）<=100\ast (\sum _{i=1}^n{a}_i)$$
$$⇨0<=100\ast (\sum _{i=1}^n{a}_i)-x\ast （\sum _{i=1}^n{b}_i）$$
$$⇨0<=(\sum _{i=1}^n{a}_i\ast 100)-（\sum _{i=1}^n{b}_i\ast x）$$
在check函数中，把所有的$a_i\ast 100-b_i\ast x$计算出来存在数组里，每次取最大的$n-k$个即可(相当于删去了最小的k个$a_i\ast 100-b_i\ast x$)。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std ;
#define ll long long
ll roundd(double number){return (number > 0.0) ? (number + 0.5) : (number - 0.5);}
const ll N = 5e3+9 ;
struct node{
    ll a , b , c ;
}sc[ N ];
bool cmp( double a , double b ){
    return a>b ;
}
ll n , k ;
bool check( double x ){
    double c[ N ] ;
    for( int i = 1 ; i <= n ; i ++ ) c[ i ] = 100*sc[ i ].a - x*sc[ i ].b ;
    sort( c+1 , c+1+n , cmp ) ;
    double sum = 0 ;
    for( int i = 1 ; i <= n-k ; i ++ ) sum += c[ i ] ;
    if( sum >= 0 ) return 1 ;
    else return 0 ;
}
int main(){
    while( scanf("%lld%lld",&n,&k) != EOF ){
        if( n == 0 && k == 0 ) break ;
        ll suma = 0 , sumb = 0 ;
        for( int i = 1 ; i <= n ; i ++ ) scanf("%lld",&sc[ i ].a) ;
        for( int i = 1 ; i <= n ; i ++ ) scanf("%lld",&sc[ i ].b) ;
        double l , r , mid , ans = 0.00 ;//注意ans无法更新时答案应该是0
        l = 0.00 , r = 1e17 ;
        for( int i = 0 ; i < 100 ; i ++ ){//10e-30
            mid = (l+r)/2.0 ;
            if( check( mid ) ){ l = mid ; ans = mid ; }
            else r = mid ;
        }
        printf("%lld\n",roundd(ans)) ;
    }
return 0 ;
}