FatMouse' Trade hdu 1009

最新推荐文章于 2020-12-04 15:13:07 发布

青苹之末

最新推荐文章于 2020-12-04 15:13:07 发布

阅读量901

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/were__wolf/article/details/10594105

版权

贪心专栏收录该内容

11 篇文章 0 订阅

订阅专栏

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34450 Accepted Submission(s): 11261

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

Sample Output

Author

CHEN, Yue

这个是一个比较经典的贪心题，就是求出所化最少，所得最高的那个比例，就是了，很经典的题目

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
struct info
{
    int j;
    int f;
    double ave;
}unit[10005];
int cmd(const info &x,const info &y)
{
    //printf("fhdshfjks");
    return x.ave<y.ave;
}
int main()
{
    int i,j,m,n;
    double sum;
    //info unit[10005];
    while(scanf("%d%d",&m,&n)!=EOF)
    {
     if((n==-1)&&(m==-1))
     break;
     for(i=0;i<n;i++)
     {
         scanf("%d%d",&unit[i].j,&unit[i].f);
         unit[i].ave=unit[i].f/(unit[i].j*1.0);
     }
     sort(unit,unit+n,cmd);
     //for(i=0;i<n;i++)
     //printf("%f\n",unit[i].ave);
     sum=0;
     //printf("%d",m);
     for(i=0;i<n&&m!=0;i++)
     {
         if(m>=unit[i].f)
         {
             sum=sum+unit[i].j;
             //printf("hdjks%f\n",sum);
             m=m-unit[i].f;
         }
         else
         {
             sum=sum+(m/(unit[i].f*1.0))*unit[i].j;
             //printf("aaa%f\n",sum);
             m=0;
             break;
         }

     }

     printf("%.3f\n",sum);
    }
    return 0;

}