FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53800 Accepted Submission(s): 17996
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
简单贪心,优先拿J/F大的就可以了
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int M=1005;
struct WH
{
int j,f;
double pf; //J/F的值
}wh[M];
bool cmp(WH a,WH b)
{
if(a.pf>b.pf)
return 1;
else return 0;
}
int main()
{
int m,n;
double ans;
while(scanf("%d%d",&m,&n)!=EOF)
{
if(m==-1&&n==-1)
break;
ans=0;
for(int i=0;i<n;i++)
{
scanf("%d%d",&wh[i].j,&wh[i].f);
wh[i].pf=(double)wh[i].j/(double)wh[i].f;
}
sort(wh,wh+n,cmp);
int p=0;
while(m>0&&p<n)
{
if(wh[p].f>m)
{
ans+=m*wh[p].j/(double)wh[p].f;
break;
}
else
{
m-=wh[p].f;
ans+=wh[p].j;
}
p++;
}
printf("%.3lf\n",ans);
}
return 0;
}