原題鏈接 Dropping tests Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11056 Accepted: 3857 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).

Source

Stanford Local 2005 題意：從n門成績中取出k門成績，剩下的成績算加權(quán)平均數(shù)（如題），求最大的平均數(shù)（四舍五入） 思路：二分平均數(shù)，這k門成績單位均值的計(jì)算方式與x滿足這樣的關(guān)系 通過變形可以得到 所以我們只需要按照這個(gè)式子進(jìn)行處理然后排序找到后n-k位加和看是不是大于等于0即可知道該平均數(shù)是否符合條件