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

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>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int m, n;
int J[1005], f[1005];
double sum=0,mid[1005];
while (scanf("%d%d",&m,&n),m!=-1&&n!=-1)
{
sum = 0.0;
for (int i = 0; i < n; i++)
{
scanf("%d%d", &J[i], &f[i]);
mid[i] = J[i] * 1.0 / f[i];
}
for (int i = 0; i < n-1; i++)
{
int t;
double Max = mid[i];
for (int j = i+1; j < n; j++)
{
if (Max < mid[j]){ Max = mid[j]; t = j; }
}
if (Max!=mid[i])
{
int k = J[i];
J[i] = J[t];
J[t] = k;
k = f[i];
f[i] = f[t];
f[t] = k;
double s;
s = mid[i];
mid[i] = mid[t];
mid[t] = s;
}
}
/*因为数据量不是很大，直接用选择排序法对mid进行排序，同时对mid数组对应的j[i]和f[i]数组进行相应的交换*/
for (int i = 0; i < n&&m!=0; i++)
{
if (f[i]>m)
{
sum = sum + m / (f[i]*1.0 )* J[i];
m = 0;
}
else if(f[i]<=m)
{
sum = sum + J[i]; m = m - f[i];
}
}
/*把每次求得的最优解相加得到最终的最优解*/
printf("%.3lf\n", sum);
}
return 0;
}


• 本文已收录于以下专栏：

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...
• baidu_23955875
• 2014年12月15日 17:24
• 1232

FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containi...
• UncleJokerly
• 2017年07月10日 10:55
• 149

• VNOpU2015
• 2014年08月13日 09:49
• 156

#include #include #include #define maxnum 1005 using namespace std; struct room_type { int J;/...
• u011806194
• 2016年07月06日 14:09
• 103

A - FatMouse’ Trade Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u S...
• u012848631
• 2015年07月24日 10:22
• 190

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...
• u012846486
• 2014年07月29日 17:07
• 548

## HDU1009 - FatMouse' Trade （贪心）

• dcf_xyz
• 2015年08月31日 15:32
• 239

http://acm.hdu.edu.cn/showproblem.php?pid=1009 解题思路：这道题是部分背包问题，我们只要用贪心算法来做。根据J[i]/F[i]的值，由大到小排序，如果M...
• q3498233
• 2010年02月26日 00:43
• 1130

FatMouse' Trade http://acm.hdu.edu.cn/showproblem.php?pid=1009 Problem Description FatMouse...
• ACM_Ted
• 2012年07月21日 19:51
• 977