本文介绍了一道编程题，涉及贪心算法。FatMouse用猫粮与守卫仓库的猫进行交易，换取JavaBean。每个房间的JavaBean量与所需猫粮量不同，且可以按比例交易。任务是找出FatMouse能获取的最大JavaBean数量。输入包含多个测试用例，每个用例包括FatMouse的猫粮量和房间数，以及每个房间的JavaBean量和猫粮需求。输出要求精确到小数点后3位，表示最大JavaBeans数量。
题目描述
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 input consists of multiple test cases. Each test case begins with a line containing two non-nega
最低0.47元/天 解锁文章
396
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
