Lightoj 1079 DP

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef struct{
int money;
double p;
}Node;

int main(){
Node bank[100];
double dp[10010];
int sum, N, T, Case = 1;
double P;

cin >> T;
while( T-- ){

cin >> P >> N;

sum = 0;
for( int i = 0; i < N; i++ ){
double temp;
cin >> bank[i].money >> temp;
bank[i].p = 1.0 - temp;
sum += bank[i].money;
}

memset( dp, 0, sizeof( dp ) );
dp[0] = 1;

for( int i = 0; i < N; i++ ){
for( int j = sum; j >= bank[i].money; j-- ){
dp[j] = max( dp[j], dp[j-bank[i].money] * bank[i].p );
}
}

int ans = 0;
for( int i = sum; i >= 0; i-- ){
if( dp[i] >= 1 - P ){
ans = i;
break;
}
}

cout << "Case " << Case++ << ": " << ans << endl;
}
return 0;
}