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
#include<cstdio>
#include<algorithm>
using namespace std;
struct node
{
double J, C;
double prop; // 比例
}a[1005];
int cmp (node a, node b)
{
return a.prop > b.prop;
}
int main()
{
double m;
int n;
while(~scanf ("%lf %d", &m, &n))
{
if (m == -1 && n == -1) break;
for (int i = 0; i < n; i++)
{
scanf ("%lf %lf", &a[i].J, &a[i].C);
a[i].prop = a[i].J / a[i].C;
}
sort (a, a+n, cmp);
double sum = 0;
for (int i = 0; i < n; i++)
{
if(m >= a[i].C)
{
sum += a[i].J;
m -= a[i].C;
}
else
{
sum += a[i].J * (m / a[i].C);
break;
}
}
printf("%.3lf\n", sum);
}
return 0;
}
原来一直WA是因为数据类型错误, 试一下把float换成double然后就AC了。。。。