HDU 1009.FatMouse' Trade【贪心算法】【8月16】

最新推荐文章于 2022-11-13 20:15:43 发布

Mr丶Gao

最新推荐文章于 2022-11-13 20:15:43 发布

阅读量818

点赞数

分类专栏：【贪心】文章标签： HDU 贪心算法 1009 C++ ACM

【贪心】专栏收录该内容

7 篇文章

订阅专栏

探讨了FatMouse使用猫粮交换仓库中JavaBeans的最大数量问题。通过贪心算法解决多个房间的资源分配，每个房间有不同的JavaBeans数量和所需猫粮数量。

FatMouse' Trade

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

  
   13.333
31.500

这个·····贪心不想多说，代码很简单：

#include<cstdio>
#include<algorithm>
using namespace std;
struct ss{
    double val,wei,vval;
};
bool cmp(ss x,ss y){
    if(x.vval>y.vval) return true;
    else return false;
}
int main(){
    int n,m;
    while(scanf("%d%d",&m,&n)!=EOF&&(n!=-1&&m!=-1)){
        ss f[1010];
        for(int i=0;i<n;i++){
            scanf("%lf %lf",&f[i].wei,&f[i].val);
            f[i].vval=f[i].wei/f[i].val;
        }
        sort(f,f+n,cmp);
        double Max=0;
        for(int i=0;i<n&&m>0.000001;i++){
            if(m>=f[i].val){
                Max+=f[i].wei;
                m-=f[i].val;
            }
            else{
                Max+=m*f[i].vval;
                m=0;
            }
        }
        printf("%.3f\n",Max);
    }
    return 0;
}