POJ2976-Dropping tests

来源：互联网发布：2016年双十一数据编辑：程序博客网时间：2024/05/29 19:38

http://poj.org/showmessage?message_id=53194

在while条件判断时要注意类似1 0的测试样例。

#include <cstdio>#include <cmath>#include <algorithm>using namespace std;const int maxn = 1000+5;const int inf = 10e9;int a[maxn];int b[maxn];double y[maxn];bool judge(double x, int n, int k) {    for (int i = 0; i < n; i++) {        y[i] = a[i] - b[i] * x;    }    sort(y, y + n);    double sum = 0;    for (int i = k; i < n; i++) {        sum += y[i];    }    return sum >= 0;}int main(int argc, char const *argv[]) {    int n, k;    while (scanf("%d%d", &n, &k) == 2 && (n || k)) {        for (int i = 0; i < n; i++) {            scanf("%d", &a[i]);        }        for (int i = 0; i < n; i++) {            scanf("%d", &b[i]);        }        double lb = 0;        double ub = 1;        for (int i = 0; i < 100; i++) {            double mid = (lb + ub) / 2;            if (judge(mid, n, k))                lb = mid;            else                ub = mid;        }        printf("%d\n", (int)(lb * 100 + 0.5));    }    return 0;}

0 0