HDU1009 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
5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1
Sample Output
13.333
31.500

我原来一直在纠结题目中的a%怎么求后来发现根本不用求
设 p=j/f，p越大，就能花费较少的 f，得到较多的 j

#include <stdio.h>
#include <algorithm>
using namespace std;
struct node
{
	double f,j,p;
}a[10010];
int cmp(node a,node b)  //按比值从大到小排序
{
	return a.p>b.p;
}
int main()
{
	int m,n;
	while(scanf("%d%d",&m,&n)!=EOF&&m!=-1)
	{
		double sum=0;
		for(int i=0;i<n;i++)
		{
			scanf("%lf%lf",&a[i].j,&a[i].f);
			a[i].p=a[i].j/a[i].f;
		}
		sort(a,a+n,cmp);
		for(int i=0;i<n;i++)
		{
			if(m>a[i].f)  //当m足够时，就用100%的f去换100%的j
			{
				m-=a[i].f;
				sum+=a[i].j;
			}
			else  //当m不够时，a%=m/f，可得到的j=m/f*j=m*j/f=m*p
			{
				sum+=(a[i].p)*m;
				break;
			}
		}
		printf("%.3lf\n",sum);
	}
	return 0;
}

代码有参考https://blog.csdn.net/IronCarrot/article/details/53607752