贪心算法--猫粮换咖啡豆

FatMouse’ Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 54406 Accepted Submission(s): 18244

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

5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

Sample Output

13.333
31.500
简要来说，就是用固定的猫粮去换尽可能多的咖啡豆

代码：

#include <iostream>
#include<algorithm>

using namespace std;

struct Javabean{
double weight;//咖啡豆的重量
double cost;//咖啡豆所需花掉的猫粮

};
Javabean a[100];
 bool Compare(Javabean x,Javabean y){
 return (x.weight/x.cost)>(y.weight/y.cost);
 }

int main()
{int m,n;
scanf("%d %d",&m,&n);
for(int i=0;i<n;i++){
    scanf("%lf %lf",&a[i].weight,&a[i].cost);
}
 sort(a,a+n,Compare); //按性价比排序
   double answer=0;
   for(int i=0;i<n;i++){

    if(m>=(a[i].cost)){
        answer+=a[i].weight;
        m-=a[i].cost;
    }
    else{
        answer+=(a[i].weight*(m/(a[i].cost)));
        m=0;
        break;
    }
   }
   printf("%.3f\n",answer);
    return 0;
}