老鼠和猫换食物题：（Problem ID：1009）

最新推荐文章于 2022-11-10 15:02:15 发布

听说森林里有糖果屋

最新推荐文章于 2022-11-10 15:02:15 发布

阅读量473

点赞数 1

分类专栏：杭电ACM

本文链接：https://blog.csdn.net/u012559347/article/details/49464029

版权

该问题描述了一只名叫FatMouse的老鼠用猫粮换取JavaBean的过程。输入包含多个测试用例，每个用例有M磅猫粮和N个房间，每个房间有不同量的JavaBean和需要的猫粮。FatMouse可以按比例交换，目标是找到最大能获取的JavaBean量。解题策略是使用贪心算法，根据比例a[i]=J[i]/F[i]排序并计算每间房能换得的JavaBean，最后保留小数点后三位精度输出结果。

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

题址：http://acm.hdu.edu.cn/showproblem.php?pid=1009

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.

Outp