贪心/hdu 1009 FatMouse' Trade

题意

  有n种物品,每一种需要不同的消费,现在手里有m块钱,求问最多可以买多少

分析

  贪心

  把每一种物品的价格算出来,然后sort一下,按照价格从便宜到贵排序,能买多少买多少,买买买!

Accepted Code

 1 /*
 2     PROBLEM:hdu1009
 3     AUTHER:Nicole Lam
 4     MEMO:贪心
 5 */
 6
 7 #include<cstdio>
 8 #include<algorithm>
 9 using namespace std;
10
11
12 struct xx
13 {
14     double j,f,price;
15 };
16 xx x[1010];
17
18
19
20 bool cmp(xx a,xx b)
21 {
22     if (a.price <= b.price) return true;
23     return false;
24 }
25
26
27 int main()
28 {
29     int m,n;
30     scanf("%d%d",&m,&n);
31     while ( m!=-1  &&  n!=-1)
32     {
33         for (int i=1;i<=n;i++)
34         {
35             scanf("%lf%lf", &x[i].j, &x[i].f);
36             x[i].price = x[i].f / x[i].j;
37         }
38         sort(x+1,x+1+n,cmp);
39
40         double ans = 0;
41
42         for (int i=1;i<=n;i++)
43         {
44             if (m>=x[i].f)
45             {
46                 m-=x[i].f;
47                 ans+=x[i].j;
48             }
49             else
50             {
51                 ans+=m*x[i].j/x[i].f;
52                 m=0;
53                 break;
54             }
55         }
56         printf("%.3lf\n",ans);
57         scanf("%d%d", &m, &n);
58     }
59     return 0;
60 }

贪心/hdu 1009 FatMouse' Trade

时间: 2024-10-03 14:25:28

贪心/hdu 1009 FatMouse' Trade的相关文章

【贪心专题】HDU 1009 FatMouse&#39; Trade (贪心选取)

链接:click here~~ 题意:老鼠准备了M磅猫食,准备拿这些猫食跟猫交换自己喜欢的食物.有N个房间,每个房间里面都有食物.你可以得到J[i]单位的食物,但你需要付出F[i]单位的的猫食. 计算M磅猫食可以获得最多食物的重量. [解题思路]贪心算法,求最优解.将J[i]/F[i]的值从大到小排列,每次取最大的,局部最优,达到全局最优,从而获得最大值. 代码: // 贪心策略,优先选择投资最大的房间,每选择一次,交换次数依次减少,最后的次数用于价值最小的 //注意精度转化:1.0*(int

HDU 1009 FatMouse&#39; Trade (贪心算法)

题意:就是老鼠要用猫粮换粮食,第i个房间一些东西,要用东西去换,可以不全换.问给定的猫粮最多能换多少粮食. 析:贪心算法.我们先算出来每个房间物品的平均价格是多少,肯定越低越好,并且如果能全换就全换,如果不能, 肯定是最后一次了,就把剩下全部换了,看看能换多少.求和. 代码如下: #include <iostream> #include <cstdio> #include <algorithm> #include <queue> #include <v

hdu 1009 FatMouse&#39; Trade(贪心)

题目来源:hdu 1009 FatMouse' Trade FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 54581 Accepted Submission(s): 18299 Problem Description FatMouse prepared M pounds of cat food, ready

HDU 1009.FatMouse&#39; Trade【贪心算法】【8月16】

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 req

HDU 1009 FatMouse&#39; 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] pound

HDU 1009 FatMouse&#39; Trade

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 59851    Accepted Submission(s): 20095 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats gu

[2016-02-04][HDU][1009][FatMouse&#39; Trade]

[2016-02-04][HDU][1009][FatMouse' Trade] FatMouse' Trade Time Limit: 1000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & %I64u Submit Status Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse

HDU ACM 1009 FatMouse&#39; Trade

分析:贪心,每次优先取需要食物的重量和猫食的重量相比最大的,所以先要按比值进行排序,注意J[i]和B[i]要声明为实型,声明为整形就挂了. #include<iostream> #include<algorithm> using namespace std; struct FAT { double f,j; double avg; } fat[1005]; bool cmp(FAT a,FAT b) { if(a.avg<b.avg) return true; else re

杭电oj 1009 FatMouse&#39; Trade

Tips:本题采用贪心算法,类似于背包问题,关键在于读入数据之后,将数据按 J[i]/F[i] 从大到小排列即可. 1 /**本程序主要采用贪心算法思想,类似于背包问题*/ 2 #include<stdio.h> 3 #include<string.h> 4 int main() 5 { 6 int M,N; 7 while(scanf("%d %d",&M,&N)) 8 { 9 if(M == -1 && N == -1) 10