FatMouse' Trade(hdu1009,贪心算法)

最新推荐文章于 2021-08-25 11:48:37 发布

Tao_oc

最新推荐文章于 2021-08-25 11:48:37 发布

阅读量185

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/weixin_41183791/article/details/81067296

版权

贪心专栏收录该内容

19 篇文章 0 订阅

订阅专栏

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

Sample Output

13.333
31.500

ac:

先根据单个价值排序

用贪心算法,尽可能的用价值大的,用完了再用下一个价值大的

注意:浮点数要求整数*1.0/整数=浮点数

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

struct node
{
    int x,y;
    double c;
}p[1024];

bool cmp(node a,node b)
{
    return a.c>b.c;
}

int main()
{
   int n,m;
   while(scanf("%d%d",&n,&m)&&(n!=-1)||(m!=-1))
   {
       double sum=0;
       for(int i=0;i<m;i++)
       {
           scanf("%d%d",&p[i].x,&p[i].y);
           p[i].c=p[i].x*1.0/p[i].y;
       }
       sort(p,p+m,cmp);
       for(int i=0;i<m&&n>0;i++)
       {
           if(n>p[i].y)
           {
               sum+=p[i].x;
               n-=p[i].y;
           }
           else{
            sum+=p[i].c*n;
            n=0;
           }
       }
       printf("%.3f\n",sum);
   }
   return 0;
}