{"trustable":false,"sections":[{"title":"Description","value":{"format":"MD","content":"Bessie has gone to the mall\u0027s jewelry store and spies a charm bracelet. Of course, she\u0027d 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 \u0027desirability\u0027 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).\n\nGiven 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.\n\n有N(1 ≤ N ≤ 3,402) 件物品和一个容量为V的背包。第i件物品的重量是w[i](1 ≤ Wi ≤ 400),价值是d[i](1 ≤ Di ≤ 100)。求解将哪些物品装入背包可使这些物品的重量总和不超过背包容量M(1 ≤ M ≤ 12,880),且价值总和最大。"}},{"title":"Input","value":{"format":"MD","content":"* Line 1: Two space-separated integers: N and M\n\n* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di\n\n第一行:物品个数N和背包大小M\n\n第二行至第N+1行:第i个物品的重量w[i]和价值d[i]"}},{"title":"Output","value":{"format":"MD","content":"* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints\n\n输出一行最大价值。"}},{"title":"Sample Input","value":{"format":"MD","content":"```\n4 6\n1 4\n2 6\n3 12\n2 7\n```"}},{"title":"Sample Output","value":{"format":"MD","content":"```\n23\n```"}}]}