Charm Bracelet（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02067113）

描述：

Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N(1 ≤ N≤ 3,402) available charms. Each charm iin the supplied list has a weight Wi(1 ≤ Wi≤ 400), a 'desirability' factor Di(1 ≤ Di≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M(1 ≤ M≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

输入：

Line 1: Two space-separated integers: N and M
Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di

输出：

Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

样例输入：

4 6

1 4

2 6

3 12

2 7

样例输出：

23

翻译：

迷人的手镯

Bessie去了mall的珠宝店并且看中了一个迷人的手镯。当然了，她想要去用N（1<=N<=3402）个可获的珠宝来填充它。每个链状的珠宝重W（1<=D<=100）,并且被用不止一次。Bessie仅仅能够支持一个这种重不超过M（1<=M<=12,880）的迷人的手镯。

被给了重量的限制和一个链状的重量并且和渴望的几率，推断最大的可能几率。

输入：

第1行：两个分开的整数：N和M

第2行到第N行：第i+1行描述了手镯i的整数Wi和Di

输出：

第一行：一个数字是最好的描述手镯的吸引力的能够满足被给出重量约束的条件

样例输入：

4 6

1 4

2 6

3 12

2 7

样例输出：

23