﻿﻿

Robberies

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

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<cstdio>
//#include<cstring>
//#include<algorithm>
//#include<cstdlib>
//#include<cmath>
//using namespace std;
//int bb[110];
//double dp[10100],rate[110];
//
//int main()
//{
//    int T;
//    double temp,p,n;
//    int i,j;
//    while(scanf("%d",&T)!=EOF)
//    {
//        while(T--)
//        {
//            int sum=0;
//            memset(dp,0,sizeof(dp));
//            dp[0]=1;
//            scanf("%lf%d",&p,&n);
//            for(i=0;i<n;i++)
//            {
//                scanf("%d%lf",&bb[i],&temp);
//                rate[i]=1-temp;
//                sum+=bb[i];
//            }
//            for(i=0;i<n;i++)
//                for(j=sum;j>=bb[i];j--)
//                if(dp[j-bb[i]]*rate[i]>dp[j])
//                dp[j]=dp[j-bb[i]]*rate[i];
//            p=1-p;
//            for(i=sum;i>=0;i--)
//                if(dp[i]>=p){
//            printf("%d\n",i);
//            break;}
//        }
//    }
//
//    return 0;
//}

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<queue>
using namespace std;

int main()
{
int T;
double p;
int n;
int bb[102];
double rate[102];
int i,j;
double temp;
int sum;
double dp[10002];
while(~scanf("%d",&T))
{
while(T--)
{
sum=0;
memset(dp,0,sizeof(dp));
dp[0]=1;
scanf("%lf%d",&p,&n);
for(i=0;i<n;i++)
{
scanf("%d%lf",&bb[i],&temp);
rate[i]=1-temp;
sum+=bb[i];
}
for(i=0;i<n;i++)
for(j=sum;j>=bb[i];j--)
{
if(dp[j-bb[i]]*rate[i]>dp[j])
dp[j]=dp[j-bb[i]]*rate[i];
}
p=1-p;
for(i=sum;i>=0;i--)
if(dp[i]>=p)
break;
printf("%d\n",i);
}
}
return 0;
}



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

hdu2955 Robberies（01背包）

• Flynn_curry
• 2016年03月21日 22:18
• 2204

HDU——2955Robberies（小数背包）

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...
• a88770202
• 2016年07月07日 13:11
• 209

hdu2955 Robberies 01背包 dp

• liuqiyao_01
• 2013年04月01日 19:15
• 3249

hdoj Robberies 2955 （概率Dp&&01背包） 好题

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
• yanghui07216
• 2015年11月20日 19:43
• 172

HDOJ 2955 Robberies

• aacm1992
• 2012年07月19日 16:59
• 919

HDU 2955 Robberies （0-1背包）

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
• i1020
• 2017年01月21日 22:53
• 80

hdu(2955)——Robberies

• 2015年09月20日 23:00
• 405

HDU2955_Robberies【01背包】

Robberies 题目大意：有一个强盗要去几个银行偷盗，他既想多投点钱，又想尽量不被抓到。已知各个银行 的金钱数和被抓的概率，以及强盗能容忍的最大被抓概率。求他最多能偷到多少钱？ 思路：背包问题，原...
• u011676797
• 2014年10月17日 19:33
• 1831

Robberies - HDU 2955 背包

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
• u014733623
• 2014年07月19日 20:06
• 455

HDOJ 2955 Robberies (0/1背包)

• u010021900
• 2013年04月19日 20:10
• 584

举报原因： 您举报文章：hdoj 2955 Robberies 【dp&&01背包】 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)