题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2159
解题方案:完全背包,dp[i][j]表示前i个物品凑出价值j的最小花费。
则:
- 第i种物品不用(用的次数为0),dp[i][j]=min(dp[i][j], dp[i-1][j])
- 第i种物品用(用1次,2次,......),dp[i][j]=min(dp[i][j], dp[i-1][j-val[i]]+cost[i], dp[i-1][j-2*val[i]]+2*cost[i], ......)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define mst(a,n) memset(a,n,sizeof(a))
#define ll long long
#define N 105
#define mod 1000000007
#define INF 0x3f3f3f3f
const double eps=1e-8;
const double pi=acos(-1.0);
const int MaxValue=200;
int n,m,k,s;
int val[N],cost[N];
int dp[N][MaxValue],tot[N][MaxValue];
int solve()
{
mst(dp,INF); mst(tot,0);
FORR(i,0,N) dp[i][0]=0;
FORR(i,1,k)
{
FOR(j,1,MaxValue)
{
dp[i][j]=dp[i-1][j];
tot[i][j]=tot[i-1][j];
for(int p=1;j>=p*val[i];p++)
{
//dp[i][j]=min(dp[i][j],dp[i-1][j-p*val[i]]+p*cost[i]);
if(dp[i][j]>dp[i-1][j-p*val[i]]+p*cost[i])
{
if(tot[i-1][j-p*val[i]]+p<=s)
{
dp[i][j]=dp[i-1][j-p*val[i]]+p*cost[i];
tot[i][j]=tot[i-1][j-p*val[i]]+p;
}
}
}
}
}
int ret=INF;
FOR(i,n,MaxValue)
{
if(dp[k][i]<=m)
ret=min(ret,dp[k][i]);
}
if(ret==INF) return -1;
else return m-ret;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(cin>>n>>m>>k>>s)
{
FORR(i,1,k) cin>>val[i]>>cost[i];
cout<<solve()<<endl;
}
return 0;
}