|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||295||152||106||53.535%|
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.
4 6 1 4 2 6 3 12 2 7
Without the second possible charm, the 4+12+7=23 is the highest value for weight 1+2+3 <= 6