FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28356 Accepted Submission(s): 9089
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
思路:所需要的猫食和换取的javabean比率降序排列,得到最大获得量的有序序列
代码:
#include<algorithm>
#include<iostream>
#include<stdio.h>
using namespace std;
struct node
{
int x;
int y;
double z;
};
int cmp(node a,node b)
{
return a.z>b.z;
}//降序排列函数
node p[1005];
int main()
{
int m,n,i;
double s;
while(scanf("%d%d",&m,&n)&&(m!=-1||n!=-1))
{
s=0.0;
for(i=0; i<n; i++)
{
scanf("%d%d",&p[i].x,&p[i].y);
p[i].z=p[i].x*1.0/p[i].y;
}
sort(p,p+n,cmp);//将结构体中的比率数组 降序排列
for(i=0; i<n; i++)
{
if(m>=p[i].y)
{
s=s+p[i].x;
m=m-p[i].y;
}
else
{
s=s+m*p[i].z;
break;
}
}
printf("%.3f\n",s);
}
return 0;
}