FatMouse' Trade

最新推荐文章于 2021-02-23 22:53:14 发布

AC__GO

最新推荐文章于 2021-02-23 22:53:14 发布

阅读量737

点赞数

分类专栏：贪心文章标签：贪心贪心算法设计哈夫曼

本文链接：https://blog.csdn.net/AC__GO/article/details/77466751

版权

贪心专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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.

Output

For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.

Sample Input

5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

Sample Output

13.333
31.500

一道英文题，简单翻译一下，就是老鼠拿猫粮去跟看守仓库的猫作交换想到尽可能多的自己喜欢的食物。
输入拥有猫粮数，仓库数，和每个仓库内食物的数量和需要的猫粮数
题解：只有优选选择单位几个最低的仓库去交易就可以了

CODE：

#include <iostream>
#include <algorithm>
using namespace std;

struct room {
    double j, f, r;
} rooms[5000];
bool cmp ( room a , room b )
{
    return a.r > b.r ;
}

int main()
{
    int m, n, i, j, flag;
    double sum ;
    while ( scanf( "%d %d" , &m , &n ) != EOF )
    {
        if ( m == -1 && n == -1 )
            break;

        for ( i = 0 ; i < n ; i++ )
        {
            scanf ( "%lf %lf" , &rooms[i].j , &rooms[i].f );
            rooms[i].r = rooms[i].j / rooms[i].f;//计算单位价格
        }           
        sort ( rooms , rooms + n , cmp );

        sum = 0; 
        flag = 0;
        for ( i = 0 ; i < n ; i++ )
        {
            if ( m == 0 )
                break;
            if ( m >= rooms[i].f )//如果可以把整个仓库买完
            {
                m -= rooms[i].f;
                sum += rooms[i].j;
            }
            else//如果不够一个仓库的钱
            {
                sum += m * rooms[i].r;
                break;
            }
        }   
        printf ( "%.3lf\n" , sum ); 
    }   
    return 0;
}