FatMouse' Trade
原题 HDU - 1009 链接 http://acm.hdu.edu.cn/showproblem.php?pid=1009
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
贪心题,有n个房间, FatMouse手里有一些猫粮,猫粮可以从这些房间换取JavaBeans,每个房间对应有付出值(猫粮)与回报值(JavaBeans),怎样用手中的猫粮换取他最喜欢的食物JavaBeans的最大回报值,这道题最重要的是看储物间里javaBean与其对应猫粮的比值,比值越大越优先。
以下是AC代码。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
int a,b;
double x;
};
bool cmp(node n,node m)
{
return n.x>m.x;
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
if(n==-1&&m==-1)break;
node str[10010];
for(int i=0; i<m; i++)
{
scanf("%d %d",&str[i].a,&str[i].b);
str[i].x=1.0*str[i].a/str[i].b;
}
sort(str,str+m,cmp);
double sum=0;
for(int i=0; i<m; i++)
{
if(n>=str[i].b)
{
sum+=str[i].a;
n-=str[i].b;
}
else
{
sum+=str[i].x*n;
break;
}
}
printf("%.3lf\n",sum);
}
return 0;
}