H - FatMouse' Trade

最新推荐文章于 2019-08-11 08:49:19 发布

team39

最新推荐文章于 2019-08-11 08:49:19 发布

阅读量166

点赞数

分类专栏：贪心二分

本文链接：https://blog.csdn.net/team39/article/details/78630239

版权

贪心二分专栏收录该内容

2 篇文章 0 订阅

订阅专栏

H - FatMouse' Trade

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

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct zw
{
    double a,b;
}k[1010];
bool cmp(zw q,zw qq)
{
    return (q.a/q.b)>(qq.a/qq.b);          //注意，以单位价值排序；
}
int main()
{
    double m;
    int n;
    while(~scanf("%lf%d",&m,&n)&&(m!=-1&&n!=-1))
    {
        double sum=0,y;
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&k[i].a,&k[i].b);
        }
        sort(k,k+n,cmp);
        for(int i=0;i<n;i++)
        {
            if(k[i].b<=m)
               {
                   m=m-k[i].b;
                   sum+=k[i].a;
             }
            else
            {
                sum+=m*k[i].a/k[i].b;
                break;                               //注意；
            }
        }printf("%.3lf\n",sum);
    }
}