这道题目描述了FatMouse用猫粮与猫咪交易JavaBean的故事。FatMouse需要找到最优策略来获取最多的JavaBean。每个房间的JavaBean数量和所需猫粮数量不同，交易比例为a%。输入包含多个测试案例，每个案例给出FatMouse的猫粮总量M和房间数N，以及每个房间的JavaBean和猫粮需求。输出应为每个案例中FatMouse能获取的最大JavaBean数，精确到小数点后三位。解题策略是优先选取比值最大的房间进行交易，并在最后检查是否有剩余猫粮。
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.
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.
最低0.47元/天 解锁文章
150
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
