牛客网暑期ACM多校训练营（第五场）A gpa【二分(01分数规划)】

链接：https://www.nowcoder.com/acm/contest/143/A
来源：牛客网
题目描述
Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i].At the university where she attended, the final score of her is
Now she can delete at most k courses and she want to know what the highest final score that can get.
输入描述:
The first line has two positive integers n,k
The second line has n positive integers s[i]
The third line has n positive integers c[i]
输出描述:
Output the highest final score, your answer is correct if and only if the absolute error with the standard answer is no more than 10-5
示例1
输入
复制
3 1
1 2 3
3 2 1
输出
复制
2.33333333333
说明
Delete the third course and the final score is
备注:
1≤ n≤ 1e5
0≤ k < n
1≤ s[i],c[i] ≤ 1e3

分析：01分数规划问题，按照题解直接二分：

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5 + 10;
const double eps = 0.00000001;
double s[MAXN], c[MAXN], d[MAXN];

int main() {
    int n, k;
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++i) scanf("%lf", &s[i]);
    for(int i = 1; i <= n; ++i) scanf("%lf", &c[i]);
    double L = 0, R = 1e11 + 7, mid;
    while(R - L > eps) {
        mid = (L + R) / 2;
        for(int i = 1; i <= n; ++i) {
            d[i] = (c[i] - mid) * s[i];
        }
        sort(d + 1, d + n + 1);
        double sum = 0.0;
        for(int i = k + 1; i <= n; ++i) sum += d[i];
        if(sum >= 0.0) L = mid;
        else R = mid;
    }
    printf("%.10lf\n", mid);
    return 0;
}