【杭电1009】FatMouse' Trade

FatMouse' Trade

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

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

 

Source

ZJCPC2004

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:   1008  1050  1005  1051  1004 

 

先按性价比从高到低排列

#include<stdio.h>
#include<algorithm>
using namespace std;
struct stu
{
double j,f;
double r;
}s[1100];
bool cmp(stu a,stu b)
{
return a.r>b.r;
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)&&(n!=-1||m!=-1))
{
for(int i=0;i<m;i++)
{
scanf("%lf%lf",&s[i].j,&s[i].f);
s[i].r=s[i].j/s[i].f;          性价比
}
sort(s,s+m,cmp);
double sum=0;
for(int i=0;i<m;i++)
{
if(n<=s[i].f)
{
sum=sum+s[i].r*n;
break;
}
else
{
sum=sum+s[i].j;
n=n-s[i].f;
}
}
printf("%.3lf\n",sum);
}
return 0;
}