HDU 2955 Robberies

//加油！

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string.h>
#include<vector>
#include<set>
#include<map>
using namespace std;
const int maxn = 10000 + 5;
double dp[maxn];
struct node
{
    int w;
    double p;
}res[maxn/100];
int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        memset(dp,0,sizeof(dp));
        memset(res,0,sizeof(res));
        double P;
        int N;
        cin >> P >> N;
        int sum = 0;
        for(int i = 0; i < N; ++i)
        {
            cin >> res[i].w >> res[i].p;
            sum += res[i].w;
        }
        dp[0] = 1;
        for(int i = 0; i < N; ++i)
        {
            for(int j = sum; j >= res[i].w; --j)
            {
                dp[j] = max(dp[j], dp[j-res[i].w] * (1-res[i].p));
            }
        }
        for(int i = sum; i >= 0; --i)
        {
            if(dp[i] > 1-P)
            {
                printf("%d\n", i);
                break;
            }
        }
    }
    return 0;
}