【hdu2955】 Robberies 01背包

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <cmath>
 6 #include <vector>
 7 #include <map>
 8 #include <utility>
 9 #include <queue>
10 #include <stack>
11 #define N 105
12 #define REP(i,n) for(i=0;(i)<(n);i++)
13 using namespace std;
14 const int INF=1<<30;
15 const double eps=1e-6;
16 
17 double dp[N*N],b[N];
18 int n,a[N];
19 
20 void run()
21 {
22     int _;
23     scanf("%d",&_);
24     while(_--)
25     {
26         int sum=0,i,j;
27         double p;
28         memset(dp,0,sizeof(dp));
29         cin>>p>>n;
30         REP(i,n)
31         {
32             cin>>a[i]>>b[i];
33             sum+=a[i];
34         }
35         dp[0]=1.0;
36         REP(i,n)
37             for(j=sum;j>=a[i];j--)
38             {
39                 dp[j]=max(dp[j],dp[j-a[i]]*(1.0-b[i]));
40             }
41         for(i=sum;i>=0;i--)
42             if(dp[i]>=1.0-p)
43             {
44                 cout<<i<<endl;
45                 break;
46             }
47     }
48 }
49 
50 int main()
51 {
52 //    freopen("case.txt","r",stdin);
53     run();
54     return 0;
55 }