当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3732：Ahui Writes Word

题目描述
We all know that English is very important, so Ahui strive for this in order to learn more English words. To know that word has its value and complexity of writing (the length of each word does not exceed 10 by only lowercase letters), Ahui wrote the complexity of the total is less than or equal to C.
Question: the maximum value Ahui can get.
Note: input words will not be the same.
输入解释
The first line of each test case are two integer N , C, representing the number of Ahui’s words and the total complexity of written words. (1 ≤ N ≤ 100000, 1 ≤ C ≤ 10000)
Each of the next N line are a string and two integer, representing the word, the value(Vi ) and the complexity(Ci ). (0 ≤ Vi , Ci ≤ 10)
输出解释
Output the maximum value in a single line for each test case.
输入样例 
5 20
go 5 8
think 3 7
big 7 4
read 2 6
write 3 5
输出样例 
15
提示
Input data is huge,please use “scanf(“%s”,s)”
来自杭电HDUOJ的附加信息
Author Ahui
Recommend notonlysuccess
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 ACMDIY第二届群赛
源链接： HDU-3732
最后修改于 2020-10-25T23:06:30+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)