light oj 1079 01背包

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#define ll long long

using namespace std;
const int N = 1e4+1000;

double dp[N];

void solve()
{
    int n;
    double p;
    int v[120],sum = 0;
    double w[120];
    scanf("%lf %d",&p,&n);
    p = 1.0 - p;
    for(int i = 0; i < n; i++)
    {
        scanf("%d %lf",&v[i],&w[i]);
        w[i] = 1.0 - w[i];
        sum += v[i];
    }

    memset(dp,0,sizeof(dp));
    dp[0] = 1.0;
    int ans = 0;
    for(int i = 0; i < n; i++)
    {
        for(int j = sum; j >= v[i]; j--)
            dp[j] = max(dp[j],dp[j-v[i]]*w[i]);
    }

    for(int i = 0; i <= sum; i++)
        if(dp[i] - p >= 1e-8)
            ans = max(ans,i);
    printf("%d\n",ans);
}

int main(void)
{
    int t,cnt = 0;
    scanf("%d",&t);

    while(t--)
    {
        printf("Case %d: ",++cnt);
        solve();
    }
    return 0;
}