题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4508
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define read(x,y) scanf("%d%d",&x,&y)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
const int maxn =1e5+5;
const int mod=1e9+7;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll n,m,x;
ll dp[maxn];///刷表
ll v[maxn],w[maxn];///价值和重量
int main()
{
while(scanf("%d",&n)!=EOF)
{
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++) scanf("%lld%lld",&v[i],&w[i]);
scanf("%lld",&m);
for(int i=0;i<n;i++)
for(int j=m;j>=0;j--)
for(int k=1;j-k*w[i]>=0;k++)
dp[j]=max(dp[j],dp[j-k*w[i]]+k*v[i]);
///ll ret=0; for(int i=0;i<=m;i++) ret=max(ret,dp[i]);
printf("%lld\n",dp[m]);
}
return 0;
}