# HDU ACM 1009 FatMouse' Trade

457人阅读 评论(0)

## 原题描述

### 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.

5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

13.333
31.500

## 参考代码

#include <iostream>
#include <algorithm>
#include <iomanip>      // C++设定输出小数点后位数
using namespace std;

struct room
{
int j, f;
}R[1001];
bool cmp(room a,room b)
{
return (double)a.j / (double)a.f > (double)b.j / (double)b.f ? true : false;
}
int main()
{
int m, n, k;
double cf, ans;
while (cin >> m >> n, m != -1 && n != -1)
{
k = 0;
ans = 0.0;
for (int i = 0; i < n;i++)
{
cin >> R[i].j >> R[i].f;
}
sort(R, R + n, cmp);
cf = (double)m;
while (m > 0 && k < n)
{
if (m <= R[k].f)
{
ans += (double)R[k].j / (double)R[k].f * m;
break;
}
else
{
m -= R[k].f;
ans += (double)R[k].j;
k++;
}
}
cout << setprecision(3) << fixed << ans << endl;
}
}
0
0

个人资料
• 访问：40703次
• 积分：1020
• 等级：
• 排名：千里之外
• 原创：61篇
• 转载：11篇
• 译文：0篇
• 评论：7条
阅读排行
最新评论