# Robberies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 28869    Accepted Submission(s): 10599

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

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 .

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.

Sample Input
3
0.04 3
1 0.02
2 0.03
3 0.05
0.06 3
2 0.03
2 0.03
3 0.05
0.10 3
1 0.03
2 0.02
3 0.05

Sample Output
2
4
6

Source
#include<stdio.h>
#include<algorithm>
using namespace std;
double dp[10001];//钱数为 i时最大的安全概率
double pi[101];
int mi[101];

int main()
{
int i,j;
int t,n,tp;
double p;
scanf("%d",&t);
while(t--)
{
scanf("%lf%d",&p,&n);
p=1-p;//安全概率
tp=0;
for(i=0;i<n;i++){
scanf("%d%lf",&mi[i],&pi[i]);
pi[i]=1-pi[i];//安全概率
tp+=mi[i];
}
for(i=0;i<=tp;i++)
dp[i]=0;
dp[0]=1;// 钱数为 0时最安全
for(i=0;i<n;i++)
{
for(j=tp;j>=mi[i];j--)
{
dp[j]=max(dp[j],dp[j-mi[i]]*pi[i]);//注意数据是浮点型，要是比较大小应 (a-b>0.0000000001)
}
}
for(i=tp;i>=0;i--)
{
if(dp[i]-p>0.0000000001)//在最大安全概率下输出最大钱数
{
printf("%d\n",i);
break;
}
}
}
return 0;
}

#### 基于OpenJPA实战百度文库项目(FlexPaperViewer在线预览、文件在线转换)

2017年08月23日 13:45

#### 01背包 Java 动态规划

2014-05-23 11:46:26

#### hdu 1864（01背包容量为浮点数）

2017-05-04 16:01:56

#### 01背包 ,完全背包,多重背包 dp (动态规划入门dp)

2017-04-12 22:44:42

#### 动态规划01背包与完全背包的C语言实现

2017-02-10 11:17:05

#### 01背包算法 动态规划（c++实现）

2016-03-29 21:59:18

#### 动态规划初步-01背包问题&&一维数组（空间复杂度优化）

2016-10-04 15:38:30

#### HDU 2955 Robberies 0-1背包 浮点数处理

2014-11-06 23:43:59

#### hdu 2955 01 背包（浮点数）

2014-05-15 14:16:46

#### HDU-2955 Robberies（小数01背包）

2016-07-22 15:55:15

## 不良信息举报

hdu-2955_Robberies_动态规划-01背包（浮点型，需转换背包容量）