优化代码#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
///状态转移方程为 dp[i][j]
double f,g;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,n;
float w[110];
int v[110];
int V;
float dp[100][5001];
cin>>t;
while(t--)
{
cin>>f>>n;
V=0;
for(int i=1;i<=n;i++)
{
cin>>v[i]>>g;
w[i]=1-g;
V+=v[i];
}
cle(dp);
//for(int i=0;i<=n;i++)
dp[0][0]=1.0;
for(int i=1;i<=n;i++)
for(int j=0;j<=V;j++)
{
if(j<v[i])dp[i][j]=dp[i-1][j];
else dp[i][j]=max(dp[i-1][j],dp[i-1][j-v[i]]*w[i]);
}
int mark=0;
for(int i=n;i>=1;i--)
{
for(int j=V;j>=0;j--)
if(dp[i][j]>=1-f){cout<<j<<endl;mark=1;break;}
if(mark)break;
}
}
return 0;
}
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
float p,pj,q,qj;int n,mj;
float dp[5000];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
cin>>t;
int vol[105];float val[105];
while(t--)
{
cle(dp);cle(val);cle(vol);
cin>>p>>n;int v=0;float a;
for(int i=1;i<=n;i++)
{
cin>>vol[i]>>a;
v+=vol[i];val[i]=1-a;
}
dp[0]=1;
for(int i=1;i<=n;i++)
for(int j=v;j>=vol[i];j--)
dp[j]=max(dp[j],dp[j-vol[i]]*val[i]);
int i;
for(i = v; i>=0;i--)
{
if(dp[i] >=1-p)
{
break;
}
}
cout<<i<<endl;
}
return 0;
}