# 做一个机智的胖老鼠（贪心）

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

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

Author
CHEN, Yue

int main()
{
double M, N;
int i;
double max;

while(1)
{
scanf("%lf %lf", &M, &N);//输入猫粮数和房间数。
if(M == -1 || N == -1)   //跳出条件
break;
double result = 0;
double F[sz], J[sz], R[sz];//猫粮，Javabean，及其比例
int ii;
for(i = 0; i < N; i ++)<span style="white-space:pre">	</span>
{
scanf("%lf %lf", &J[i], &F[i]);
R[i] = J[i]*1.0 / F[i];
}
while(M && result != N) //跳出条件：猫粮用完或者Javabean全部get
{
max = 0;
for(i = 0; i < N; i ++)<span style="white-space:pre">	</span>//每一次都找最划算的房间
{
if(R[i] > max)
{
max = R[i];<span style="white-space:pre">	</span>//记录最大值，用于比较
ii = i;<span style="white-space:pre">		</span>//记录该房间的号码，用于交易
}
}
if(M > F[ii])<span style="white-space:pre">		</span>//足够提供这个房间所需的全部猫粮
{
M -= F[ii];
result += J[ii];
R[ii] = 0;<span style="white-space:pre">	</span>//交换完成置零，不再参与
}
else<span style="white-space:pre">			</span>//不够，用完就跳出了
{
result += (J[ii]*M*1.0)/(F[ii]*1.0);
M = 0;
R[ii] = 0;
}
}
printf("%.3f\n",result);


#### 如何做一个机智的人

2006-06-17 17:17:00

#### ZJOI 2010 贪吃的老鼠 网络流

2017-02-02 16:56:00

#### 贪心之猫鼠交易

2018-06-15 13:14:16

2016-05-27 13:54:23

#### 电子老鼠闯迷宫Java源码

2010年05月22日 2.45MB 下载

#### 罗胖精选 | 做产品最重要的是格局

2018-03-20 15:44:47

#### cocos2d-iphone 游戏码源 魔塔20层

2013年02月22日 6.78MB 下载

#### CodeForces-545C Woodcutters 【贪心+机智】

2016-04-20 23:39:51

#### 技术胖 ES6

2017年11月09日 58B 下载

#### HDOJ 1009 FatMouse' Trade （胖老鼠和猫做生意，贪心）

2016-07-23 16:45:10