【HDU 2955】Robberies（DP）

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 105
using namespace std;
int t, n, m[N];
double P, p[N], dp[10200];
int main()
{
    scanf("%d", &t);
    while(t--)
    {
        memset(dp, 0, sizeof dp);
        m[0] = 0;
        scanf("%lf %d", &P, &n);
        for(int i = 1; i <= n; i++)
        {
            scanf("%d %lf", &m[i], &p[i]);
            m[0] += m[i];
        }
        dp[0] = 1;
        for(int i = 1; i <= n; i++)
            for(int j = m[0]; j >= m[i]; j--)
                dp[j] = max(dp[j], dp[j - m[i]] * (1 - p[i]));
 
        while(P<=1-dp[m[0]])m[0]--;
        printf("%d\n", m[0]);
    }
}