hdu4508

<pre name="code" class="cpp"><pre name="code" class="cpp">/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
#define pk push_back
template<class T> inline T Get_Max(const T&a,const T&b){return a < b?b:a;}
template<class T> inline T Get_Min(const T&a,const T&b){return a < b?a:b;}
typedef long long ll;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int dp[N];
int v[500];
int w[500];
int n;
int G;
int main()
{	
	// ios::sync_with_stdio(false);
	freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	while(~scanf("%d",&n)){
		int a,b;
		int tol = 0;
		for (int i = 0;i < n;++i){
			cin >> v[i] >> w[i];
		}
		cin >> G;
		MEM(dp,0);
		for (int i = 0;i < n;++i){
			if (w[i] > G) continue;
			int num = G / w[i];
			int j = 1;
			while(j <= num){
				int vv = j * v[i];
				int ww = j * w[i];
				for (int k = G;k >= ww;k--)
					dp[k] = Get_Max(dp[k],dp[k - ww] + vv);
				num -= j;
				j <<= 1;
			}
			if (num){
				int vv = num * v[i];
				int ww = num * w[i];
				for (int k = G;k >= ww;k--)
					dp[k] = Get_Max(dp[k],dp[k - ww] + vv);
			}
		}
		int ans = *max_element(dp,dp + G + 1);
		cout << ans << endl;
	}
	return 0;
}