01背包（物品限量一维）

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 i in 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.

Input

• 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
  Output
• Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
• 译文：
• 贝西去了商场的珠宝店，发现了一个迷人的手镯。当然，她想从N（1≤N≤3402）个可用的字符中填充尽可能好的字符。所提供清单中的每个魅力i都有一个权重Wi（1≤Wi≤400），一个“可取性”因子Di（1≤Di≤100），并且最多可以使用一次。贝西只能支持重量不超过M（1≤M≤12880）的魅力手镯。 给定该权重限制作为约束条件，并列出具有其权重和期望值的魅力列表，推导出可能的最大评级和。
  输入
  *第1行：两个空格分隔的整数：N和M
  *第2…N+1行：第i+1行用两个空格分隔的整数Wi和Di描述charm i 输出
  第1行：一个整数，它是在给定权重约束的情况下可以实现的最大魅力需求的总和
  Sample Input
  4 6
  1 4
  2 6
  3 12
  2 7
  Sample Output
  23
  第一行n,m;紧