Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions:14919 | Accepted: 5208 |
Description
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 n positive 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
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).
#include<cstdio>
#include<algorithm>
using namespace std;
double a[1003],b[1003],c[1003];
int main()
{
int n,k;
while(~scanf("%d%d",&n,&k))
{
if(!(n+k))break;
int i,j;
for(i=0;i<n;i++)
scanf("%lf",&a[i]);
for(i=0;i<n;i++)
scanf("%lf",&b[i]);
double q=0,r=1;
while(r-q>0.000001)
{
double mid=(r+q)/2;
for(i=0;i<n;i++)
c[i]=a[i]-b[i]*mid;
sort(c,c+n);
double s=0;
for(i=n-1,j=0;j<(n-k);j++,i--)
s+=c[i];
if(s>=0)q=mid;
else r=mid;
}
printf("%d\n",(int)(r*100+0.5));
}
return 0;
}