FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32207 Accepted Submission(s): 10402
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.
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
Recommend
JGShining
贪心按交换比率排序。从交换比率大的开始交换。
#include <iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
struct jud
{
double j,f,jf;
} jd[1010];
int cmp(jud a,jud b)
{
return a.jf>b.jf;
}
int main()
{
int n,m,i;
double ma;
while(scanf("%d%d",&m,&n))
{
if(n==-1&&m==-1)
break;
for(i=0;i<n;i++)
{
scanf("%lf%lf",&jd[i].j,&jd[i].f);
jd[i].jf=jd[i].j/jd[i].f;
}
sort(jd,jd+n,cmp);
ma=0;
for(i=0;i<n;i++)
{
if(m>jd[i].f)
ma+=jd[i].j,m-=jd[i].f;
else
{
ma+=m*jd[i].jf;
break;
}
}
printf("%.3lf\n",ma);
}
return 0;
}