hdoj 1009 FatMouse' Trade

FatMouse' Trade

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

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
  
  

 题倒是不难，就是全英文难理解·····题目说的是老鼠和Java交换食物，对于第i个仓库中的食物，老鼠用质量为f[i]的猫食才能换来质量为j[i]的粮食。开头M，N分别表示老鼠所有的食物总量和二者可以交换的仓库总数。食物是可以分割的，所求的是老鼠用手上全部猫食所能换来的最大粮食。

#include<stdio.h>
#include<algorithm>
using namespace std;
struct food
{
    double cat;
    double mouse;
}num[1010];
bool cmp(food a,food b)
{
    if(a.cat*b.mouse!=a.mouse*b.cat)
    return (a.cat*b.mouse>a.mouse*b.cat);
    else
    return (a.mouse>b.mouse);
}
int main()
{
    int n,i,j;
    double need,get,thing;
    while(scanf("%lf %d",&need,&n)&&(need!=-1||n!=-1))
    {
        for(i=0;i<n;i++)
        {
            scanf("%lf %lf",&num[i].cat,&num[i].mouse);
        }
        sort(num,num+n,cmp);
        get=thing=0;
        for(i=0;i<n;i++)
        {
            if(thing+num[i].mouse<=need)
            {
                thing+=num[i].mouse;
                get+=num[i].cat;
            }
            else
            {
                get+=num[i].cat*(need-thing)/num[i].mouse;
                thing=need;
            }
            if(thing==need)
            break;
        }
        printf("%.3lf\n",get);
    }
    return 0;
}