Dropping tests（poj 2976）01分数规划

偷吃了老鼠的土豆

于 2018-08-12 15:02:29 发布

阅读量102

点赞数

分类专栏：分数规划

本文链接：https://blog.csdn.net/guagua_de_xiaohai/article/details/81606411

版权

分数规划专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目；http://poj.org/problem?id=2976

In a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be

Given your test scores and a positive integer k, determine how high you can make your cumulative average if you are allowed to drop any k of your test scores.

Suppose you take 3 tests with scores of 5/5, 0/1, and 2/6. Without dropping any tests, your cumulative average is . However, if you drop the third test, your cumulative average becomes .

Input

The input test file will contain multiple test cases, each containing exactly three lines. The first line contains two integers, 1 ≤ n ≤ 1000 and 0 ≤ k < n. The second line contains n integers indicating ai for all i. The third line contains npositive integers indicating bi for all i. It is guaranteed that 0 ≤ ai ≤ bi ≤ 1, 000, 000, 000. The end-of-file is marked by a test case with n = k = 0 and should not be processed.

Output

For each test case, write a single line with the highest cumulative average possible after dropping k of the given test scores. The average should be rounded to the nearest integer.

Sample Input

Sample Output

83
100

Hint

To avoid ambiguities due to rounding errors, the judge tests have been constructed so that all answers are at least 0.001 away from a decision boundary (i.e., you can assume that the average is never 83.4997).

分析：数组x[]={0,1}，给你两个数列，a[],b[]值一一对应，求出 $\sum (a[i]*x[i])-\sum (b[i]*x[i])$ 的最大值。

转：

那么可以转化一下。令r = ∑a[i] * x[i] / (b[i] * x[i]) 则必然∑a[i] * x[i] - ∑b[i] * x[i] * r= 0；（条件1）

并且任意的 ∑a[i] * x[i] - ∑b[i] * x[i] * max(r) <= 0 (条件2，只有当∑a[i] * x[i] / (b[i] * x[i]) = max(r) 条件2中等号才成立)

然后就可以枚举r , 对枚举的r，求Q(r) = ∑a[i] * x[i] - ∑b[i] * x[i] * r 的最大值，为什么要求最大值呢？因为我们之前知道了条件2，所以当我们枚举到r为max(r)的值时，显然对于所有的情况Q(r)都会小于等于0，并且Q(r)的最大值一定是0.而我们求最大值的目的就是寻找Q(r)=0的可能性，这样就满足了条件1，最后就是枚举使得Q(r)恰好等于0时就找到了max(r)。而如果能Q(r)>0 说明该r值是偏小的，并且可能存在Q(r)=0,而Q(r)<0的话，很明显是r值偏大的，因为max(r)都是使Q(r)最大值为0，说明不可能存在Q(r)=0了。

原题中使得c最大，假设c就是答案，那么有：

a1+a2+...+ak=c∗(b1+b2+...+bk)a1+a2+...+ak=c∗(b1+b2+...+bk)
a1+a2+...+ak=c∗b1+c∗b2+...+c∗bka1+a2+...+ak=c∗b1+c∗b2+...+c∗bk
(a1−c∗b1)+(a2−c∗b2)...+(ak−c∗bk)=0(a1−c∗b1)+(a2−c∗b2)...+(ak−c∗bk)=0

所以我们可以二分一个c，判断是否可行。

设新数组d[i]=a[i]−c∗b[i]d[i]=a[i]−c∗b[i]，从d数组中挑出(n−k+1)(n−k+1)最大的数，如果大于等于0，那么c满足，否则不满足。

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

const int maxn = 1005;
double dp[maxn];
double a[maxn],b[maxn];
int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k)&&(n + k))
    {
        for(int i = 0;i < n;i ++)
        {
            scanf("%lf",&a[i]);
        }
        for(int i = 0;i < n;i ++)
        {
            scanf("%lf",&b[i]);
        }
        double l = 0;
        double r = 1.0;
        double mid;
        while(l + 1e-7 < r)
        {
            mid = (l + r)/2;
            for(int i = 0; i < n; i ++)
                dp[i] = a[i] - b[i] * mid;
            sort(dp,dp + n);
            double sum = 0;
            for(int i = k; i < n;i ++)
                sum += dp[i];
                if(sum > 0) l = mid;
                else r = mid;
        }
        printf("%.0lf\n",100*mid);//结果保留整数部分，如果直接取整会丢失，还有一种解决方法就是给后边加0.5
    }
    return 0;
}