POJ 3111 二分

题意

传送门 POJ 3111

最大化平均值问题，求满足下式的最大 $x$

$\sum v_i/\sum w_i\ge x$

不等式变形，即

$\sum (v_i-x\ast w_i)\ge 0$

贪心法求最大的 $k$ 个珠宝 $(v_i-x\ast w_i)$ 是否满足条件即可。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#define min(a,b)    (((a) < (b)) ? (a) : (b))
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define abs(x)    ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-6
#define PI 3.14159265358979323846
#define MAX_N 100005
using namespace std;
typedef pair<double, int> P;
int N, K;
int W[MAX_N], V[MAX_N];
P Y[MAX_N];

bool C(double x){
	for(int i = 0; i < N; i++) Y[i].first = V[i] - W[i] * x, Y[i].second = i;
	sort(Y, Y + N);
	double s = 0;
	for(int i = 0; i < K; i++) s += Y[N - 1 - i].first;
	return s >= 0;
}

int main(){
	while(~scanf("%d%d", &N, &K)){
		for(int i = 0; i < N; i++) scanf("%d%d", V + i, W + i);
		double left = 0, right = 1e7 + 1;
		while(right - left > eps){
			double mid = (left + right) / 2;
			if(C(mid)) left = mid;
			else right = mid;
		}
		for(int i = 0; i < K; i++) printf("%d%c", Y[N - 1 - i].second + 1, i == K - 1 ? '\n' : ' ');
	}
	return 0;
}