01:
完全:
01:
#include<stdio.h>
#include<string.h>int dp[1005];
int v[1005],w[1005];
int max(int a,int b)
{
return a>b?a:b;
}
int main()
{
int n,m,t,i,j,k,V;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof(dp));
memset(v,0,sizeof(v));
memset(w,0,sizeof(w));
scanf("%d%d",&n,&V);
for(i=1;i<=n;i++)
{
scanf("%d",&w[i]);
}
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
for(i=1;i<=n;i++)
for(j=V;j>=0;j--)
{
if(j>=v[i])
dp[j]=max(dp[j-v[i]]+w[i],dp[j]);
}
/*for(i=0;i<=n;i++)
{for(j=0;j<=V;j++)
{
{printf("%d ",dp[i][j]);}
}printf("\n");}*/
printf("%d\n",dp[V]);
}
return 0;
}
完全:
#include<stdio.h>
#include<string.h>
int min(int a,int b)
{
if(a>b)
return b;
else
return a;
}
int main()
{
int dp[10005],q[10005],w[10005];
int e,f,t,i,j,k,n,m;
scanf("%d",&t);
while(t--)
{
memset(w,0,sizeof(w));
memset(q,0,sizeof(q));
scanf("%d%d",&e,&f);
f=f-e;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d",&w[i],&q[i]);
}
for(i=0;i<10004;i++)
{
dp[i]=99999989;
}
for(i=1;i<=n;i++)
{
//for(j=0;j<=f;j++)
{
for(k=q[i];k<=f;k++)
{
dp[k]=min(dp[k-q[i]]+w[i],dp[k]);
}
}
}
if(dp[f]%99999989==0 && dp[f]>=99999989)
printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f]);
}
return 0;
}