杭电ACM OJ 1009 FatMouse' Trade 简单的贪心算法入门级翻译好题目就能做出来

本文链接：https://blog.csdn.net/qq_36523667/article/details/78503108

本文详细解析杭电ACM Online Judge（OJ）中编号1009的FatMouse' Trade问题，这是一个适合入门级别的贪心算法题目。通过翻译题目，理解题意，可以运用简单的贪心策略解决。

摘要由CSDN通过智能技术生成

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 82705 Accepted Submission(s): 28651

Problem Description

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 J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* 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.

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 J[i] and F[i] respectively. The last test case is followed by two -1's. 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 JavaBeans that FatMouse can obtain.