hdu2159二维完全背包

#include<iostream>#include<cstdio>using namespace std;int a[101],b[101];int dp[101][101]; //dp[i][j]表示用i的忍耐度杀死j个怪得到的最多经验值int n,m,k,s;int max(int a,int b){return a>b?a:b;}void solve(int sum,int w,int v){int i,j;for(i=w;i<=sum;i++) //二维完全背包for(j=1;j<=s;j++)dp[i][j]=max(dp[i][j],dp[i-w][j-1]+v);}int main(){while(scanf("%d%d%d%d",&n,&m,&k,&s)!=EOF){int i,j;for(i=0;i<k;i++)scanf("%d%d",&a[i],&b[i]);memset(dp,0,sizeof(dp));for(i=0;i<k;i++)solve(m,b[i],a[i]);i=0;while(dp[i][s]<n&&i<=m)i++;printf("%d/n",m-i);}return 0;}