杭电oj--1009 ( FatMouse' Trade )--贪心算法

源……

于 2018-12-07 21:24:29 发布

阅读量500

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ACM 文章标签：杭电oj

本文链接：https://blog.youkuaiyun.com/weixin_44008482/article/details/84887292

博客介绍了杭电oj中的题目‘FatMouse’ Trade，该问题要求计算FatMouse用有限的cat food能获得的最大JavaBeans量。通过贪心策略，根据每个房间的JavaBeans与cat food比例（性价比）进行选择，优先处理性价比高的房间，确保最大化收益。文章提供了两种解题思路，一种是直接计算最高性价比房间，另一种是先对房间数据按性价比排序后再计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

FatMouse' Trade

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.