poj 2973(01规划)

Dropping tests

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6106		Accepted: 2117

Description

In a certain course, you take n tests. If you get a_i out of b_i 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 a_i for all i. The third line contains n positive integers indicating b_i for all i. It is guaranteed that 0 ≤ a_i ≤ b_i ≤ 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

3 1
5 0 2
5 1 6
4 2
1 2 7 9
5 6 7 9
0 0

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).

Source

Stanford Local 2005

直接就是01规划了，百度01规划看看是什么东西，然后你就会做了。

AC代码：

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
struct Node{
    double x,y,s;
}a[1010];
int cmp(Node t1,Node t2){
    return t1.s>t2.s;
}
int main(){
    int n,k;
    while(scanf("%d%d",&n,&k)!=EOF){
        if(n==0 && k==0)
            break;
        for(int i=1;i<=n;i++)
            scanf("%lf",&a[i].x);
        for(int i=1;i<=n;i++)
            scanf("%lf",&a[i].y);
        double l,r,mid;
        l=0.0; r=100.0;
        while(r-l>0.0001){
            double sum=0.0;
            mid=(l+r)/2;
            for(int i=1;i<=n;i++)
                a[i].s=100.0*a[i].x-mid*a[i].y;
            sort(a+1,a+n+1,cmp);
            for(int i=1;i<=n-k;i++){
                sum+=a[i].s;
            }
            if(sum>0)
                l=mid;
            else
                r=mid;
        }
        printf("%.0lf\n",mid);
    }
    return 0;
}