137人阅读 评论(0)

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 57164    Accepted Submission(s): 19152

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<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
int m, n;
int J[1005], f[1005];
double sum=0,mid[1005];
while (scanf("%d%d",&m,&n),m!=-1&&n!=-1)
{
sum = 0.0;
for (int i = 0; i < n; i++)
{
scanf("%d%d", &J[i], &f[i]);
mid[i] = J[i] * 1.0 / f[i];
}
for (int i = 0; i < n-1; i++)
{
int t;
double Max = mid[i];
for (int j = i+1; j < n; j++)
{
if (Max < mid[j]){ Max = mid[j]; t = j; }
}
if (Max!=mid[i])
{
int k = J[i];
J[i] = J[t];
J[t] = k;
k = f[i];
f[i] = f[t];
f[t] = k;
double s;
s = mid[i];
mid[i] = mid[t];
mid[t] = s;
}
}
/*因为数据量不是很大，直接用选择排序法对mid进行排序，同时对mid数组对应的j[i]和f[i]数组进行相应的交换*/
for (int i = 0; i < n&&m!=0; i++)
{
if (f[i]>m)
{
sum = sum + m / (f[i]*1.0 )* J[i];
m = 0;
}
else if(f[i]<=m)
{
sum = sum + J[i]; m = m - f[i];
}
}
/*把每次求得的最优解相加得到最终的最优解*/
printf("%.3lf\n", sum);
}
return 0;
}


1
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：14432次
• 积分：880
• 等级：
• 排名：千里之外
• 原创：70篇
• 转载：0篇
• 译文：0篇
• 评论：0条
评论排行