FatMouse' Trade hdu+贪心

FatMouse' Trade

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %I64d & %I64u

[Submit]   [Go Back]   [Status]  

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<stdio.h>
using namespace std;
int main()
{
    double J[1005],F[1005];
    double F_J[1005];
    double M,MAX,temp;
    int N;
    int i,j;
    while(~scanf("%lf %d",&M,&N))
    {
        if(M==-1&&N==-1)
        return 0;
        for(i=0;i<N;i++)
        {scanf("%lf %lf",&J[i],&F[i]);
         F_J[i]=F[i]/J[i];}


       MAX=F_J[0];
      for(i=0;i<N-1;i++)
       for(j=i+1;j<N;j++)
       {
         if(F_J[i]>F_J[j])
         {
             temp=F[i];F[i]=F[j];F[j]=temp;
             temp=J[i];J[i]=J[j];J[j]=temp;
             temp=F_J[i];F_J[i]=F_J[j];F_J[j]=temp;
         }
       }///看到这排序，严重鄙视自己
       i=0;
       MAX=0.0;
      while(M&&i<N)
      {
          if(M>=F[i])
          {
              MAX+=J[i];
              M=M-F[i];
              i++;
          }
          else
          {
              MAX+=(M/F[i])*J[i];
              break;
          }

      }
      printf("%.3lf\n",MAX);
    }
    return 0;
}