hdu 2955 Robberies

Robberies

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	while(t--){
		double p,w[128],dp[10000+1024];
		int n,v[128],maxv=0;
		scanf("%lf %d",&p,&n);
		for(int i=0;i<n;++i){
			scanf("%d %lf",v+i,w+i);
			maxv+=v[i];
		}
		fill(dp,dp+maxv+1,0.0);
		dp[0]=1;
		for(int i=0;i<n;++i){
			for(int j=maxv;j>=v[i];--j){
				dp[j]=max(dp[j],dp[j-v[i]]*(1-w[i]));
			}
		}
		for(int i=maxv;i>=0;--i){
			if(dp[i]>1-p){
				printf("%d\n",i);
				break;
			}
		}
	}
	return 0;
}

猜你喜欢

转载自blog.csdn.net/gl486546/article/details/79837529