hdu 2955

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define N 110
#define FOR(i,a,b) for(int i=(a);i<=(b);i++ )
#define FOR(i,n) for( int i=0;i<(n);i++ )
#define RFOR(i,a,b) for(int i=(a);i>=(b);i-- )
using namespace std;
double dp[N*N],p[N];
int a[N];
int main()
{
    int cas,n;
    double P;
    scanf("%d",&cas);
    while( cas -- )
    {
        int sum=0;
        scanf("%lf %d",&P,&n);
        FOR(i,n) {
            scanf("%d %lf",&a[i],&p[i]);
            p[i]=1-p[i];
            sum+=a[i];
        }
        FOR(i,sum+1) dp[i] = 0;
        dp[0]=1;
        sum = 0;
        FOR(i,n) {
            sum+=a[i];
            RFOR(j,sum,a[i]) if( dp[ j-a[i] ]*p[i]>dp[j] )
            dp[j]=dp[j-a[i]]*p[i];
        }
        RFOR(i,sum,0)
        {
            if((1-dp[i])<=P )
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}