Problem:
Score : 400 points

Problem Statement

You have N items and a bag of strength W.
The i-th item has a weight of w_i and a value of v_i.

You will select some of the items and put them in the bag.
Here, the total weight of the selected items needs to be at most W.

Your objective is to maximize the total value of the selected items.

Constraints

1 ≤ N ≤ 100

1 ≤ W ≤ 10^9

1 ≤ w_i ≤ 10^9

For each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.

1 ≤ v_i ≤ 10^7

W, each w_i and v_i are integers.

Input

Input is given from Standard Input in the following format:

N W
w_1 v_1
w_2 v_2
:
w_N v_N

Output

Print the maximum possible total value of the selected items.

Sample Input 1

4 6
2 1
3 4
4 10
3 4

Sample Output 1

11

The first and third items should be selected.

Sample Input 2

4 6
2 1
3 7
4 10
3 6

Sample Output 2

13

The second and fourth items should be selected.

Sample Input 3

4 10
1 100
1 100
1 100
1 100

Sample Output 3

400

You can take everything.

Sample Input 4

4 1
10 100
10 100
10 100
10 100

Sample Output 4

0

You can take nothing.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
const int MAX_C = 100010;
int t[101][101][101][101];
void SimpleKnapsack() {

	int n;
	ll W;
	cin >> n >> W;
	ll wf = -1;
	ll ar[4] = {0,0,0,0};
	int res = 0;

	for (size_t i = 0; i < n; i++)
	{
		ll w;
		int v;
		cin >> w >> v;
		if (wf == -1) {
			wf = w;
		}
		int mi = w - wf;
		for (short j = ar[0]; j >= 0; j--)
		{
			ll tj = j * wf;
			for (short k =ar[1]; k >= 0; k--)
			{
				ll tk = tj + k * (wf + 1);
				for (short g = ar[2]; g >= 0; g--)
				{
					ll tg = tk + g * (wf + 2);
					for (short u = ar[3]; u >= 0; u--)
					{
						ll tu = tg + u * (wf + 3);
						if (tu + w <= W) {
							if (t[j + (mi == 0)][k + (mi == 1)][g + (mi == 2)][u + (mi == 3)]
								< t[j][k][g][u] + v) {
								int aa = t[j][k][g][u] + v;
								t[j + (mi == 0)][k + (mi == 1)][g + (mi == 2)][u + (mi == 3)] = aa;
								res = max(aa, res);
							}
						}
					}
				}
			}
		}
		ar[mi]++;
	}
	cout << res << endl;

}
int main() {

	SimpleKnapsack();
	return 0;
}