hdu 1009 FatMouse' Trade

happy_lcj

于 2014-06-15 18:59:50 发布

阅读量579

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/acm_code/article/details/31016157

版权

贪心专栏收录该内容

6 篇文章 0 订阅

订阅专栏

链接:hdu 1009

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

代码：

#include<cstdio>
#include<algorithm>
using namespace std;
struct stu
{
    int j,f;
    double a;
};
int cmp(struct stu a,struct stu b)
{
    return a.a>b.a;
}
int main()
{
    struct stu s[1010];
    int i,n,m;
    double sum;
    while(scanf("%d%d",&m,&n)!=EOF){
        if(m==-1&&n==-1)
            break;
        for(i=1;i<=n;i++){
            scanf("%d%d",&s[i].j,&s[i].f);
            s[i].a=(double)s[i].j/s[i].f;
        }
        sort(s+1,s+n+1,cmp);
        sum=0;
        for(i=1;i<=n;i++){
            if(m>=s[i].f){
                sum+=s[i].j;
                m-=s[i].f;
            }
            else{
                sum+=s[i].a*m;
                m=0;
            }
            if(m==0)
                break;
        }
        printf("%.3lf\n",sum);
    }
    return 0;
}