1009 FatMouse’ Trade 简单贪心算法

最新推荐文章于 2019-04-18 10:09:43 发布

张镇鸿

最新推荐文章于 2019-04-18 10:09:43 发布

阅读量619

点赞数

分类专栏：杭电oj题库－贪心类文章标签： ACM 算法贪心杭电 OJ

本文链接：https://blog.csdn.net/Jolesen/article/details/53665535

版权

这篇博客主要探讨了在杭电在线判题平台（OJ）上的一道名为'FatMouse' Trade的问题，通过使用贪心算法进行求解。文章详细介绍了如何运用简单的贪心策略来解决这个问题，适合对ACM算法感兴趣的读者学习。

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

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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.