HDU1009:FatMouse' Trade(初探贪心,wait)

Posted Roni

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU1009:FatMouse' Trade(初探贪心,wait)相关的知识,希望对你有一定的参考价值。

FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. 
The warehouse has N rooms. The i-th room contains Jii pounds of JavaBeans and requires Fii pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get Jii* a% pounds of JavaBeans if he pays Fii* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain. 

InputThe input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers Jii and Fii respectively. The last test case is followed by two -1‘s. All integers are not greater than 1000. 
OutputFor each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain. 
Sample Input

5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

Sample Output

13.333
31.500

以上是关于HDU1009:FatMouse' Trade(初探贪心,wait)的主要内容,如果未能解决你的问题,请参考以下文章

HDU 1009FatMouse' Trade

HDU 1009 FatMouse' Trade

hdu 1009 FatMouse' Trade

hdu 1009 FatMouse' Trade

HDU 1009 FatMouse' Trade

Hdu 1009 FatMouse' Trade