CF Round #350 (Div. 2)D1. Magic Powder - 1（未完成）

D1. Magic Powder - 1

time limit per test 1 second

This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find the problem too difficult in large constraints, you can write solution to the simplified version only.

Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs n ingredients, and for each ingredient she knows the value ai — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all n ingredients.

Apollinaria has bi gram of the i-th ingredient. Also she has k grams of a magic powder. Each gram of magic powder can be turned to exactly 1 gram of any of the n ingredients and can be used for baking cookies.

Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder.

Input
The first line of the input contains two positive integers n and k (1 ≤ n, k ≤ 1000) — the number of ingredients and the number of grams of the magic powder.

The second line contains the sequence a1, a2, …, an (1 ≤ ai ≤ 1000), where the i-th number is equal to the number of grams of the i-th ingredient, needed to bake one cookie.

The third line contains the sequence b1, b2, …, bn (1 ≤ bi ≤ 1000), where the i-th number is equal to the number of grams of the i-th ingredient, which Apollinaria has.

Output
Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder.

Examples
input

3 1
2 1 4
11 3 16
output
4

input

4 3
4 3 5 6
11 12 14 20

output

3

Note
In the first sample it is profitably for Apollinaria to make the existing 1 gram of her magic powder to ingredient with the index 2, then Apollinaria will be able to bake 4 cookies.

In the second sample Apollinaria should turn 1 gram of magic powder to ingredient with the index 1 and 1 gram of magic powder to ingredient with the index 3. Then Apollinaria will be able to bake 3 cookies. The remaining 1 gram of the magic powder can be left, because it can’t be used to increase the answer.

题目大意：

D：制作一块饼干需要n种原料，每一种ai克。现在有每种原料分别bi克。而且你现在还有k克的魔法粉末，每一克粉末都可以当作任意一种原料一克使用。求最多能制作多少个饼干。

分析：
二分搜索（binary search）应用：最大化其最小值
（假定一个解判断是否可行）
这里的检查的条件是最小值为x的时候，ans+=max(a[i]*x-b[i],0)这里的ans与k克魔法粉的关系
如果此时x过小，表现为要求太低，ans<=k(这里有等于号是因为(lb,ub]是左开右闭的数组)，令lb=mid
这里二分写的有点问题（）待续吧！！