JZOJ Day 3-B组-T2——淬炼神体

题目大意：

有$n$个地方，去到第$i$个地方会有$a_i$和$b_i$
要去$k$个地方，怎么选择使得$\sum a_i/\sum b_i(iϵS)$
S表示去的地方的集合

解题思路：

然后我们二分K
然后每次取$ai/k-bi$最大的$k$个就好了

Accepted code：

#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;

const int N = 100005;

int n, k;
double l, r, a[N], b[N], c[N];

double read() {
     int flag = 1, f = 0; char c = getchar();
     while (!isdigit(c)) { if (c == '-') flag = -1; c = getchar();}
     while (isdigit(c)) f = f * 10 + c - 48, c = getchar();
     return (double)f * flag;
}

bool Check(double checknum) {
	double ans = 0;
	for (int i = 1; i <= n; i++)
		c[i] = a[i] / checknum - b[i];
	sort(c+1, c+1+n);
	for (int i = n; i >= n - k + 1; i--)
	  ans += c[i];
	return ans >= 0;
}

int main() {
    n = (int)read(), k = (int)read();
	for (int i = 1; i <= n; i++) a[i] = read();
	for (int i = 1; i <= n; i++) b[i] = read();
	l = 1e-4, r = 20000;
	while (r - l > 1e-4) {
		double mid = (l + r) / 2.0;
		if (Check(mid)) l = mid;
        else r = mid;
	}
	printf("%0.3lf", l);
}