HD3033I love sneakers!(分组背包+不懂)
2015-12-16 21:18
183 查看
I love sneakers!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4765 Accepted Submission(s): 1950
[align=left]Problem Description[/align]
After months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sneaker store.
There are several brands of sneakers that Iserlohn wants to collect, such as Air Jordan and Nike Pro. And each brand has released various products. For the reason that Iserlohn is definitely a sneaker-mania, he desires to buy at least one product for each brand.
Although the fixed price of each product has been labeled, Iserlohn sets values for each of them based on his own tendency. With handsome but limited money, he wants to maximize the total value of the shoes he is going to buy. Obviously, as a collector, he won’t buy the same product twice.
Now, Iserlohn needs you to help him find the best solution of his problem, which means to maximize the total value of the products he can buy.
[align=left]Input[/align]
Input contains multiple test cases. Each test case begins with three integers 1<=N<=100 representing the total number of products, 1 <= M<= 10000 the money Iserlohn gets, and 1<=K<=10 representing the sneaker brands. The following N lines each represents a product with three positive integers 1<=a<=k, b and c, 0<=b,c<100000, meaning the brand’s number it belongs, the labeled price, and the value of this product. Process to End Of File.
[align=left]Output[/align]
For each test case, print an integer which is the maximum total value of the sneakers that Iserlohn purchases. Print "Impossible" if Iserlohn's demands can’t be satisfied.
[align=left]Sample Input[/align]
5 10000 3 1 4 6 2 5 7 3 4 99 1 55 77 2 44 66
[align=left]Sample Output[/align]
255
相关文章推荐
- 修改Netbeans默认使用UTF-8编码
- 在线文本编辑器控件
- 共同构建网络空间命运共同体
- UIViewController的生命周期及iOS程序执行顺序
- ajax请求,请求头是provisional are shown。请求未发送出去
- Bias vs. Variance(3)---用learning curves来判断bias/variance problem
- LeetCode练习:subset
- 传感器sensor的使用
- iOS开发UI篇—核心动画(基础动画)
- 【转】Windows Error Code(windows错误代码详解)
- in文件
- hadoop datanode启动失败
- CentOS 7.2安装详解
- hdoj Saving Beans 3037 (Lucas定理入门)
- iOS block里的self
- 深入理解IOS中的UIScrollView(附测试代码)
- BZOJ 1045 (UVa 11300) 数学分析 + 结论
- Redis文件事件处理用到的基本数据结构视图
- USACO Humble Numbers
- Qt 打开文件引发的种种操作方法!