HDU 1009 - FatMouse' Trade（贪心）

最新推荐文章于 2022-11-13 20:15:43 发布

Vectors_

最新推荐文章于 2022-11-13 20:15:43 发布

阅读量456

点赞数

CC 4.0 BY-SA版权

分类专栏：贪心算法文章标签：贪心 c HDU ACM

本文链接：https://blog.youkuaiyun.com/qq_15654993/article/details/75810034

贪心算法专栏收录该内容

8 篇文章

订阅专栏

解决FatMouse如何用有限的猫粮换取最多JavaBeans的问题。通过排序和贪心算法找到最优解。

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

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 Jii pounds of JavaBeans and requires Fii pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get Jii* a% pounds of JavaBeans if he pays Fii* 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 Jii and Fii 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

Solution

题目大意：老鼠要买吃的它有m元，有n种吃的，老鼠花费pay元可以得到get的食物。求老鼠最大可以买到多少单位的食物。
解题思路：pay/get就是一单位食物的价格。定义结构体，定义rat=pay/get，以升序排序。从便宜的买起即可。

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define N 10010
struct node
{
    double  get, pay;
    double  rat;
}cat[N];
int cmp(node a, node b)
{
    return a.rat < b.rat;
}

int main(int argc, char const *argv[])
{
    int m, n;
    while (scanf("%d%d", &m, &n))
    {
        if (m == -1 && n == -1) break;
        double ans = 0;
        for (int i = 0; i < n; i++)
        {
            scanf("%lf%lf", &cat[i].get, &cat[i].pay);
            cat[i].rat = cat[i].pay / cat[i].get;
        }
        sort(cat, cat + n,cmp);
        for (int i = 0; i < n; i++)
        {
            if (m >= cat[i].pay)
            {
                m -= cat[i].pay;
                ans += cat[i].get;
            }
            else
            {
                ans += m / cat[i].rat;
                break;
            }
        }
        printf("%.3lf\n", ans);
    }
    return 0;
}