POJ2976 Dropping tests

知识点：二分

这个题有个模型叫什么01分数规划，给你若干个物品，每个物品有质量和价值，让你选k个，问最大的能选到的单位质量的价值是多少，这种题你直觉的那种贪心的做法是错的，至于为什么，举例，书上也没说，然后就是做法，用套二分，白书写的很详细，就不写了，但是那个转化的判断函数属实很巧妙，然后这个题的结果是需要四舍五入的，

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>

#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 1005;

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

bool cmp(double x, double y) {
    return x > y;
}

bool check(double x) {
    for (int i = 0; i < n; i++) c[i] = a[i] - x * b[i];
    sort(c, c + n, cmp);
    double sum = 0;
    for (int i = 0; i < n - k; i++) {
        sum += c[i];
    }
    return sum >= 0;
}

void solve(double l, double r) {
    for (int i = 0; i < 100; i++) {
        double mid = (l + r) / 2;
        if (check(mid)) l = mid;
        else r = mid;
    }
    printf("%d\n", (int) (l * 100 + 0.5));
}

int main() {
    while (cin >> n >> k && n) {
        for (int i = 0; i < n; i++) cin >> a[i];
        for (int i = 0; i < n; i++) cin >> b[i];
        solve(0, 1000000000);
    }
    return 0;
}