Fatmouse ' TradeTime
limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 53352 Accepted Submission (s): 17788
Problem Descriptionfatmouse prepared M pounds of cat food, ready-to-trade with the cats guarding the warehouse containing He favorite food, JavaBean.
The warehouse has N rooms. The i-th contains j[i] pounds of JavaBeans and requires f[i] pounds of cat food. Fatmouse does not has the to trade for all the JavaBeans in the the the same, instead, he may get j[i]* a% of pounds JavaBeans if he Pays f[i]* a% pounds of cat food. Here A is a real number. Now he's 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 is begins with a line containing the non-negative integers M and N. Then N lines follow, each contains, non-negative integers j[i] and f[i] respectively. The last test case was followed by Two-1 ' s. All integers is 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 Amoun T of JavaBeans that Fatmouse can obtain.
Sample Input
5 37 24 35 220 325 1824 1515 10-1-1
Sample Output
13.33331.500
There are m cat food n rooms, each room has a cat guard, each room has a J you want things, to get things, will give cat food every cat has a prescribed cat food, you give the cat food accounted for the proportion of the provisions is you get the proportion of things, the ball up to how many simple greedy, sort, Evaluation 2015,7,20
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
HDU 1009 Fatmouse ' Trade