当前位置:网站首页>FatMouse' Trade (Hangdian 1009)
FatMouse' Trade (Hangdian 1009)
2022-07-07 20:59:00 【Full stack programmer webmaster】
Hello everyone , I meet you again , I'm the king of the whole stack .
FatMouse’ Trade
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
// This is a simple greedy problem . It means that rats have m Bang cat food , By giving cat food data[i].b Be able to exchange data[i].a, Ask how much food you can exchange at most .// Just put data[i].a/data[i].b The value of can be sorted from large to small . #include<stdio.h>struct st{ double a; double b; double c;}data[1000];int main(){ int i,j,m,n; struct st data[1000],t; while(scanf("%d %d",&m,&n)&&(m!=-1||n!=-1)) { double sum=0.000; for(i=0;i<n;i++) { scanf("%lf %lf",&data[i].a,&data[i].b); } for(i=0;i<n;i++) { for( j=i+1;j<n;j++) { if((data[i].a/data[i].b)<data[j].a/data[j].b) { t=data[i]; data[i]=data[j]; data[j]=t;} } } for(i=0;i<n;i++) { if(m-data[i].b>=0.001) { sum+=data[i].a; m-=data[i].b; } else { sum=sum+m*data[i].a/data[i].b; break; } } printf("%.3lf\n",sum); } return 0;}
Publisher : Full stack programmer stack length , Reprint please indicate the source :https://javaforall.cn/116298.html Link to the original text :https://javaforall.cn
边栏推荐
- object-c编程tips-timer「建议收藏」
- 解决使用uni-app MediaError MediaError ErrorCode -5
- Is it safe to open an account of BOC shares in kainiu in 2022?
- Network principle (1) - overview of basic principles
- Postgresql数据库character varying和character的区别说明
- 写一下跳表
- 【函数递归】简单递归的5个经典例子,你都会吗?
- I have to use my ID card to open an account. Is the bank card safe? I don't understand it
- Numerical method for solving optimal control problem (0) -- Definition
- 现在网上开户安全么?想知道我现在在南宁,到哪里开户比较好?
猜你喜欢
AADL inspector fault tree safety analysis module
使用高斯Redis实现二级索引
程序猿赚的那点钱算个P啊!
Network principle (1) - overview of basic principles
Klocwork code static analysis tool
不落人后!简单好用的低代码开发,快速搭建智慧管理信息系统
MySQL约束之默认约束default与零填充约束zerofill
CodeSonar通过创新型静态分析增强软件可靠性
How does codesonar help UAVs find software defects?
Small guide for rapid formation of manipulator (11): standard nomenclature of coordinate system
随机推荐
【矩阵乘】【NOI 2012】【cogs963】随机数生成器
HDU4876ZCC loves cards(多校题)
H3C s7000/s7500e/10500 series post stack BFD detection configuration method
阿洛的烦恼
Nebula Importer 数据导入实践
Onespin | solve the problems of hardware Trojan horse and security trust in IC Design
Intelligent transportation is full of vitality. What will happen in the future? [easy to understand]
How does codesonar help UAVs find software defects?
Phoenix JDBC
uva 12230 – Crossing Rivers(概率)「建议收藏」
私募基金在中國合法嗎?安全嗎?
FTP steps for downloading files from Huawei CE switches
Tensorflow2.x下如何运行1.x的代码
You want to kill a port process, but you can't find it in the service list. You can find this process and kill it through the command line to reduce restarting the computer and find the root cause of
机械臂速成小指南(十一):坐标系的标准命名
Lingyun going to sea | yidiantianxia & Huawei cloud: promoting the globalization of Chinese e-commerce enterprise brands
Cantata9.0 | 全 新 功 能
Is private equity legal in China? Is it safe?
Intelligent software analysis platform embold
特征生成