POJ 3111 K Best 二分

K Best POJ 3111 二分

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

Description
Demy has $n$ jewels. Each of her jewels has some value $v_i$ and weight $w_i$.
Since her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has decided that she would keep $k$ best jewels for herself. She decided to keep such jewels that their specific value is as large as possible. That is, denote the specific value of some set of jewels $S=i_1,i_2,\dots ,i_k$ as
$$S(s)=\begin{array}{c}\underline{{\sum }_{j=1}^k{v}_{i}j}\\ {\sum }_{j=1}^k{w}_{i}j\end{array}$$
Demy would like to select such $k$ jewels that their specific value is maximal possible. Help her to do so.

Input
The first line of the input file contains $n$ — the number of jewels Demy got, and $k$ — the number of jewels she would like to keep $(1\le k\le n\le 100000)$.

The following n lines contain two integer numbers each — $v_i$ and $w_i$ ($0\le vi\le 106,1\le wi\le 106$, both the sum of all $v_i$ and the sum of all $w_i$ do not exceed 10⁷).

Output
Output k numbers — the numbers of jewels Demy must keep. If there are several solutions, output any one.

Sample Input	Sample Output
3 2 1 1 1 2 1 3	1 2

题意：
有 $n$ 组 $v$ 和 $w$ ，每个 $v$ 和 $w$ 一一对应，对应的 $v$ 和 $w$ 会有同样的编号，用 $i$ 表示。现在可以从 $n$ 组 $i$ 中选择 $k$ 组，使得 $$S(s)=\begin{array}{c}\underline{{\sum }_{j=1}^k{v}_{i}j}\\ {\sum }_{j=1}^k{w}_{i}j\end{array}$$ 最大。
考虑二分S,要使得S最大，即合法的答案x需要满足 $$x<=\begin{array}{c}\underline{{\sum }_{j=1}^k{v}_{i}j}\\ {\sum }_{j=1}^k{w}_{i}j\end{array}$$
即$$x\ast （\sum _{j=1}^k{w}_{i}j）<=\sum _{j=1}^k{v}_{i}j$$
即$$0<=（\sum _{j=1}^k{v}_{i}j）\ast x-（\sum _{j=1}^k{w}_{i}j）$$即$$0<=（\sum _{j=1}^k{v}_{i}j\ast x）-（\sum _{j=1}^k{w}_{i}j）$$
据此，在编写check函数时，我们可以先把所有的$v_i\ast x-w_i$存在一个数组里，从大到小排序取前$k$项，若前$k$项和$sum$满足$sum>=0$，则答案合法，返回$1$，否则返回$0$。

AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std ;
const ll N = 2e5+9 ;
struct node{
    ll v , w , th ;
    double val ;
}a[ N ];
bool cmp( node a , node b ){
    return a.val > b.val ;
}
ll n , k ;
bool check( double x ){
    for( int i = 1 ; i <= n ; i ++ ) { a[ i ].val = a[ i ].v - a[ i ].w*x ; }
    sort( a+1 , a+1+n , cmp ) ;
    double sum = 0 ;
    for( int i = 1 ; i <= k ; i ++ ) sum += a[ i ].val ; //取前k个最大的
    if( sum >= 0 ) return 1 ;
    else return 0 ;
}
int main(){
    while( scanf("%lld%lld",&n,&k) != EOF ){
        for( int i = 1 ; i <= n ; i ++) {  scanf("%lld%lld",&a[i].v,&a[i].w) ; a[ i ].th = i ; }
        double l = 0 , r = 1e7, mid ;
        for( int i = 1 ; i <= 100 ; i ++ ){
            mid = (l+r)/2.0 ;
            if( check( mid ) ){ l = mid ; }
            else r = mid ;
        }
        for( int i = 1 ; i <= k ; i ++ )
            printf("%lld ",a[i].th) ;
        printf("\n");
    }
return 0 ;
}