hdu 2955 Robberies

#include<stdio.h>#include<algorithm>#include<string.h>#include<iostream>using namespace std;int main(){   int t,i,j,n,sum,m[105];   double d[10000+5],g[10000+5],p;   scanf("%d",&t);   while(t--)   {       scanf("%lf%d",&p,&n);       p=1-p;       for(sum=0,i=0;i<n;i++)       {           scanf("%d%lf",&m[i],&g[i]);           g[i]=1-g[i];           sum+=m[i];       }       memset(d,0,sizeof(d));       d[0]=1;       for(i=0;i<n;i++)       {           for(j=sum;j>=m[i];j--)            d[j]=max(d[j],d[j-m[i]]*g[i]);       }       for(i=sum;i>=0;i--)       {           if(d[i]-p>0.000000001)            break;       }       printf("%d\n",i);   }    return 0;}