# Robberies

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

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

#include <iostream>
#include <cstring>
#define maxv 10005
#define maxn 105
using namespace std;
double ans[maxv],p[maxn],P;
int T,N,m[maxn],tot;
int main()
{
cin>>T;
while(T--){
tot=0;          // 非常重要，不然第二组数据可能会超过int范围，会出RE
memset(ans,0,sizeof(ans));  //初始化也同样重要
ans[0]=1;
cin>>P>>N;
for(int i=1; i<=N; i++){
cin>>m[i]>>p[i];
tot += m[i];
}
//背包 转换为乘法 使同一个点不被捉的概率最大
for(int i=1; i<=N; i++){
for(int j=tot; j>=m[i]; j--){
if(ans[j]<ans[j-m[i]]*(1-p[i]))
ans[j]=ans[j-m[i]]*(1-p[i]);
}
}

//输出i而不是ans[i]
for(int i=tot; i>=0; i--)
if(ans[i]>=1-P){
cout<<i<<endl;
break;
}
}
return 0;
}


• 本文已收录于以下专栏：

## HDU2955 Robberies(特殊思路，概率背包)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

## HDU——2955Robberies（小数背包）

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...

## HDU 2955 Robberies

1.题目描述：点击打开链接 2.解题思路：本题利用01背包解决。不过稍微运用了一下逆向思维。如果按照经典的思路，应该是概率作为容量，钱数作为价值，但是由于概率是浮点数，不能直接当做下标来使用，因此不...

## [HDU 2955] Robberies (01背包问题)

Robberies 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2955 题目大意： 　　某人想要抢银行，而抢每家银行可以得到相应的钱M...
• SIOFive
• 2013年12月09日 01:08
• 767

## hdu 2955 Robberies DP

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
• hyccfy
• 2015年01月17日 17:41
• 307

## HDU Problem 2955 Robberies 【01背包】

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

## HDU 2955 - Robberies(01 背包)

The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually g...

举报原因： 您举报文章：hdu-2955-Robberies 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)