PROGRAMMING:Moon Cake
Moon cake is a traditional food for Chinese people during the Mid Autumn Festival. There are many different flavors of moon cakes in different regions. Now, given the inventory, total price and maximum demand of all kinds of moon cakes, please calculate the maximum profit you can get.
Note: it is allowed to take out part of the inventory during sales. The example shows the following situation: if we have three kinds of moon cakes, the inventory is 180000 tons, 150000 tons and 100000 tons respectively, and the total price is RMB 7.5 billion, RMB 7.2 billion and RMB 4.5 billion respectively. If the maximum demand of the market is only 200000 tons, then our maximum revenue strategy should be to sell all 150000 tons of the second moon cake and 50000 tons of the third moon cake, and get 72 + 45 / 2 = 9.45 billion yuan.
###Input format:
Each input contains a test case. For each test case, a positive integer no more than 1000, $$n $, denotes the number of moon cakes, and a positive integer no more than 500 (in 10000 tons, $$d $), denotes the maximum market demand. In the next line, $$n $$positive numbers are given, indicating the inventory of each kind of moon cake (in 10000 tons); The last line gives $$n $$positive numbers, indicating the total price of each kind of moon cake (in 100 million yuan). Numbers are separated by spaces.
###Output format:
For each group of test cases, output the maximum revenue in one line, in the unit of 100 million yuan, and accurate to 2 decimal places.
###Input example:
```in
3 20
18 15 10
75 72 45
```
###Output example:
```out
ninety-four point five zero
```
answer：If there is no answer, please comment
Note: it is allowed to take out part of the inventory during sales. The example shows the following situation: if we have three kinds of moon cakes, the inventory is 180000 tons, 150000 tons and 100000 tons respectively, and the total price is RMB 7.5 billion, RMB 7.2 billion and RMB 4.5 billion respectively. If the maximum demand of the market is only 200000 tons, then our maximum revenue strategy should be to sell all 150000 tons of the second moon cake and 50000 tons of the third moon cake, and get 72 + 45 / 2 = 9.45 billion yuan.
###Input format:
Each input contains a test case. For each test case, a positive integer no more than 1000, $$n $, denotes the number of moon cakes, and a positive integer no more than 500 (in 10000 tons, $$d $), denotes the maximum market demand. In the next line, $$n $$positive numbers are given, indicating the inventory of each kind of moon cake (in 10000 tons); The last line gives $$n $$positive numbers, indicating the total price of each kind of moon cake (in 100 million yuan). Numbers are separated by spaces.
###Output format:
For each group of test cases, output the maximum revenue in one line, in the unit of 100 million yuan, and accurate to 2 decimal places.
###Input example:
```in
3 20
18 15 10
75 72 45
```
###Output example:
```out
ninety-four point five zero
```
answer：If there is no answer, please comment