hdu2955-01背包

Robberies

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

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
IDI Open 2009
转化为抢一定钱数的情况下最大的安全概率，以银行的钱为v，然后求最大的安全概率，一开始没注意钱数的范围是10000，一定要注意，不然就会超时==，心累啊==

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
double dp[10010],val[110];
int cost[110];
int main(){
    int n,t,i,j,sum;
    double bel;
    //freopen("in.txt","r",stdin);
    scanf("%d",&t);
    while(t--){
        scanf("%lf%d",&bel,&n);
        bel=1-bel;
        sum=0;
        for ( i = 0; i < n; ++i)
        {
            scanf("%d%lf",&cost[i],&val[i]);
            val[i]=1-val[i];
            sum+=cost[i];

        }
        for ( i = 1; i <= sum; ++i)
        {
            dp[i]=0;
        }
        dp[0]=1;
        for ( i = 0; i < n; ++i)
        {
            for ( j = sum; j >= cost[i]; j--)
            {
                dp[j]=max(dp[j],dp[j-cost[i]]*val[i]);
            }
        }
        for ( i = sum; i >= 0; i--)
        {

            if(dp[i]>=bel){
                printf("%d\n", i);
                break;
            }    
        }

    }
    return 0;
}