25 人解决，37 人已尝试。
34 份提交通过，共有 83 份提交。
4.8 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
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 W_i (1 <= W_i <= 400), a ‘desirability’ factor D_i (1 <= D_i <= 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: W_i and D_i
4 6 1 4 2 6 3 12 2 7 INPUT DETAILS: Four potential charms; maximum weight 6
23 OUTPUT DETAILS: Without the second possible charm, the 4+12+7=23 is the highest value for weight 1+2+3 <= 6
25 人解决，37 人已尝试。
34 份提交通过，共有 83 份提交。
4.8 EMB 奖励。