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
题意:FatMouse准备了M磅的猫粮,仓库有N个房间。 第i个房间包含J [i]磅的JavaBeans并且需要F [i]磅的猫粮。 FatMouse不需要为房间里的所有JavaBeans进行交易,相反,如果他支付F [i] *a%磅的猫粮,他可能会得到J磅的JavaBeans。简单贪心。
#include<iostream>
#include<iomanip>
#include<algorithm>
using namespace std;
struct node
{
double j;
int f;
double t ;
}a[1010];
bool cmp(node a, node b)
{
return a.t > b.t;
}
int main()
{
int m, n;
double s;
while (cin >> m >> n)
{
s = 0;
if (m == -1 && n == -1)
{
break;
}
for (int i = 0; i < n; i++)
{
cin >> a[i].j >> a[i].f;
a[i].t = a[i].j / a[i].f;
}
sort(a, a + n, cmp);
for (int i = 0; i < n; i++)
{
if (m>a[i].f)
{
m -= a[i].f;
s += a[i].j;
}
else{
s += (double)m / a[i].f*a[i].j;
break;
}
}
cout.setf(ios::fixed);
cout << setprecision(3) << s << endl;
}
return 0;
}