关闭

HDU ACM 1009 FatMouse' Trade

标签: acm贪心
457人阅读 评论(0) 收藏 举报
分类:

原题描述

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.

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

解题思路

题意:胖老鼠准备了一些猫粮,想与猫交换房间里的JavaBean。
有很多房间,每个房间中有J JavaBean,需要F 猫粮来换。

按照单价从大到小将房间排序,枚举,累加出结果。

参考代码

#include <iostream>
#include <algorithm>
#include <iomanip>      // C++设定输出小数点后位数
using namespace std;

struct room
{
    int j, f;
}R[1001];
bool cmp(room a,room b)
{
    return (double)a.j / (double)a.f > (double)b.j / (double)b.f ? true : false;
}
int main()
{
    int m, n, k;
    double cf, ans;
    while (cin >> m >> n, m != -1 && n != -1)
    {
        k = 0;
        ans = 0.0;
        for (int i = 0; i < n;i++)
        {
            cin >> R[i].j >> R[i].f;
        }
        sort(R, R + n, cmp);
        cf = (double)m;
        while (m > 0 && k < n)
        {
            if (m <= R[k].f)
            {
                ans += (double)R[k].j / (double)R[k].f * m;
                break;
            }
            else
            {
                m -= R[k].f;
                ans += (double)R[k].j;
                k++;
            }
        }
        cout << setprecision(3) << fixed << ans << endl;
    }
}
0
0
查看评论

杭电ACM 1009:FatMouse' Trade

原创作品 转载请注明出http://blog.csdn.net/always2015/article/details/47747077这一道题意思就是老鼠用猫食物换取自己最喜爱的食物javaBean的过程,当然换取的最终结果是保证最后的JavaBean是最多的,而且是当自己手中的猫食物小于每个仓库所...
  • Always2015
  • Always2015
  • 2015-08-18 09:44
  • 1318

杭电 acm 1009 FatMouse' Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 48150...
  • lsgqjh
  • lsgqjh
  • 2015-03-12 00:28
  • 387

FatMouse' Trade(贪心算法)

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 459...
  • baidu_23955875
  • baidu_23955875
  • 2014-12-15 17:24
  • 1229

acm 1009 FatMouse' Trade

贪心问题 看了别人的代码,利用类来解决会让代码看起来简洁一点#include<iostream> #include<iomanip> using namespace std;struct room{ double catfood; double javabe...
  • wyfiveron
  • wyfiveron
  • 2017-07-04 10:17
  • 68

HDU 1009:FatMouse' Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 753...
  • wyxeainn
  • wyxeainn
  • 2017-04-05 10:13
  • 111

HDU:1009 FatMouse' Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 687...
  • wyxeainn
  • wyxeainn
  • 2016-10-20 17:26
  • 124

hdu 1009 FatMouse' Trade

Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean....
  • maqinyao5566
  • maqinyao5566
  • 2016-07-08 19:43
  • 110

hdu 1009 FatMouse' Trade

贪心。。。。。。 #include #include using namespace std; int main()    //0 1不行了 {  int M,N;//M 老鼠有的猫粮 N 仓库的数目  double ans=0; ...
  • qq_37573025
  • qq_37573025
  • 2017-11-21 19:56
  • 21

hdu 1009 FatMouse' Trade

hdu  1009  FatMouse' Trade         题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1009 贪心入门 题目大意:fat mouse跟cat做生意,...
  • fghdvbgt
  • fghdvbgt
  • 2013-08-18 14:57
  • 553

HDU——1009——FatMouse' Trade

#include #include #include using namespace std; struct node { double h,p; double r; }a[1000]; int cmp(node e,node f) { return (e.r>f.r); } in...
  • u011470356
  • u011470356
  • 2013-07-25 15:23
  • 429
    个人资料
    • 访问:40703次
    • 积分:1020
    • 等级:
    • 排名:千里之外
    • 原创:61篇
    • 转载:11篇
    • 译文:0篇
    • 评论:7条
    最新评论