hdu_1009_FatMouse' Trade

csu_huangning

于 2015-07-28 16:55:22 发布

阅读量179

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/baidu_29998627/article/details/47107939

版权

贪心专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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 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 
     
     
     
     

     
     
     
     

     
     
     
     

     
     
     
     
      
      简单的贪心问题，按照j/f比值由大到小排序，而且要用double型数据。
     
     
     
     

     
     
     
     
      
      #include <stdio.h>
#include <algorithm>


using namespace std;




struct node
{
    double j,f,ave;
};


node a[1002];
double m;
int n;


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


int main()
{
    while(scanf("%lf%d",&m,&n)!=EOF&&m!=-1&&n!=-1)
    {
        double sum=0;
        for(int i=1;i<=n;i++) {
            scanf("%lf%lf",&a[i].j,&a[i].f);
            a[i].ave=(a[i].j/a[i].f);
        }
        sort(a+1,a+n+1,cmp);
        for(int i=1;i<=n;i++)
        {
            if(m>=a[i].f)
            {
                sum+=a[i].j;
                m-=a[i].f;}
            else {sum+=a[i].ave*m;break;}
        }
        printf("%.3lf\n",sum);
    }
    return 0;
}