10724: Greedy Mouse
Memory Limit:64 MB
Time Limit:1.000 S
Judge Style:Text Compare
Creator:
Submit:2
Solved:0
Description
A fat mouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food:peanut. The warehouse has N rooms. The ith room containsW[i] pounds of peanut and requires F[i] pounds of cat food. Fatmouse does not have to trade for all the peanut in the room, instead, he may get W[i]*a% pounds of peanut if he pays F[i]*a% pounds of cat food. The mouse is a greedy mouse, so can you tell him the maximum amount of peanut he can obtain.
Input
The 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 W[i] and F[i] respectively. The
test case is terminated by two -1. All integers are not greater than
1000.
Output
For each test case, print in a single line a real number accurate up to 3
decimal places, which is the maximum amount of penaut that FatMouse can
obtain.
Sample Input Copy
5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1
Sample Output Copy
13.333
31.500