HDU 2955
来源:互联网 发布:淘宝联盟的意思 编辑:程序博客网 时间:2024/04/29 17:25
Description
The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university.
For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.
His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.
For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.
His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.
Input
The first line of input gives T, the number of cases. For each scenario, the first line of input gives a floating point number P, the probability Roy needs to be below, and an integer N, the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj and a floating point number Pj .
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
Output
For each test case, output a line with the maximum number of millions he can expect to get while the probability of getting caught is less than the limit set.
Notes and Constraints
0 < T <= 100
0.0 <= P <= 1.0
0 < N <= 100
0 < Mj <= 100
0.0 <= Pj <= 1.0
A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
Notes and Constraints
0 < T <= 100
0.0 <= P <= 1.0
0 < N <= 100
0 < Mj <= 100
0.0 <= Pj <= 1.0
A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
题意:一个人去抢银行,再被抓概率小于P的情况下,他最多能抢到多少钱。这道题是0-1背包的水题,关于被抓的概率不是很好算,将被抓的概率转化为不被抓的概率为1-P来考虑。
0 0
- hdu 2955
- HDU 2955
- HDU 2955
- HDU 2955
- hdu 2955
- hdu 2955
- hdu 2955
- hdu 2955
- hdu 2955
- HDU--2955
- hdu 2955
- HDU 2955
- HDU 2955
- HDU 2955
- hdu 2955
- hdu--2955
- HDU 2955
- hdu 2955
- ORA-12514 TNS 监听程序当前无法识别连接描述符中请求服务 的解决方法
- Android隐式启动:Intent的用法
- 20、Java入门—反射之动态加载类
- 浏览器各项面板代表的含义
- linux后台运行和关闭、查看后台任务
- HDU 2955
- 当使用json写map对象时里面的重复对象会变成引用,导致前段取不到
- [51nod月赛19C]集合对
- 阿里云 EDAS-HSF 用户指南
- iOS流媒体开发之一:总结系统提供的接口
- Android的ListView简单的自定义上拉加载
- 1031学习记录 形参列表使用class进行封装
- 全屏及退出全屏
- [Extjs modern] 如何在gridpanel的列中添加按钮