Just another Robbery （概率+01背包）

原题目：

As Harry Potter series is over, Harry has no job. Since he wants to make quick money, (he wants everything quick!) so he decided to rob banks. He wants to make a calculated risk, and grab as much money as possible. But his friends - Hermione and Ron have decided upon a tolerable probability P of getting caught. They feel that he is safe enough if the banks he robs together give a probability less than P.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a real number P, the probability Harry needs to be below, and an integer N (0 < N ≤ 100), the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj (0 < Mj ≤ 100) and a real number Pj . Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj. A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.

Output

For each case, print the case number and the maximum number of millions he can expect to get while the probability of getting caught is less than P.

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

Case 1: 2

Case 2: 4

Case 3: 6

Note

For the first case, if he wants to rob bank 1 and 2, then the probability of getting caught is 0.02 + (1 - 0.02) * .03 = 0.0494 which is greater than the given probability (0.04). That's why he has only option, just to rob rank 2.

中文概要：
一个人去抢劫银行，当他的被捕概率小于P时才能行动，对于已存在的n个银行，每个银行含有属性w表示含有价值，属性p表示被捕概率，每个银行的被捕概率为独立的。询问在被捕概率小于P的前提，可以抢劫的最大价值。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct Node{
	int w;//价值 
	double p;//被抓概率 
}rec[105];
double dp[10005];
int main()
{
	int k=1,t,v,n;
	double p;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf%d",&p,&n);
		p=1-p,v=0;//[将被捕概率转换为安全概率，即将被捕概率小于P的限制条件转换为安全概率不小于1-P] + [01背包体积：价值]
		for(int i=0;i<n;i++)
		{
			scanf("%d%lf",&rec[i].w,&rec[i].p);
			rec[i].p=1-rec[i].p;
			v+=rec[i].w;//v表示总价值 
		}
		memset(dp,0,sizeof(dp));
		dp[0]=1;
		for(int i=0;i<n;i++)
		{
			for(int j=v;j>=rec[i].w;j--)
			{
				dp[j]=max(dp[j],dp[j-rec[i].w]*rec[i].p);
			}
		}
		for(int i=v;i>=0;i--)
		if(dp[i]>=p)
		{
			printf("Case %d: %d\n",k++,i);
			break;
		}
	}
	return 0;
}

思路：

[将被捕概率转换为安全概率，即将被捕概率小于P的限制条件转换为安全概率不小于1-P] + [01背包体积：价值]