最多买几件
来源:互联网 发布:舞台灯光软件 编辑:程序博客网 时间:2024/06/18 05:53
Submit: 11 Solved: 2
[Submit][Status][Web Board] [Edit] [TestData]
Description
As you know, Gardon trid hard for his love-letter, and now he's spending too much time on choosing flowers for Angel.
When Gardon entered the flower shop, he was frightened and dazed by thousands kinds of flowers.
"How can I choose!" Gardon shouted out.
Finally, Gardon-- a no-EQ man decided to buy flowers as many as possible.
Can you compute how many flowers Gardon can buy at most?
Input
Input have serveral test cases. Each case has two lines.
The first line contains two integers: N and M. M means how much money Gardon have.
N integers following, means the prices of differnt flowers.
Output
For each case, print how many flowers Gardon can buy at most.
You may firmly assume the number of each kind of flower is enough.
Sample Input
2 52 3
Sample Output
2
HINT
Source
Xwxcy
- 最多买几件
- 最多约数
- 出书最多
- 最多区间
- 笔划最多的汉字
- 咖啡每天最多能喝几杯
- 最多约数问题
- url 最多可以多长
- 找最多0
- 最多的字母
- 寻路:最多拐弯一次
- 最多约数问题
- 最多约数问题
- 最多不相交线段
- 最多约数问题
- 【最多约数问题】
- 问题八十六:最多约数
- hdu2304(最多插口)
- Spring对JDBC的支持JdbcTemplate模板类
- 关于出现Not an editor command: Bundle '**/*.vim'的解决方案
- linux命令大全
- 使用std::cout不能输出显示
- JQuery的主要操作函数
- 最多买几件
- erlang应用行为模式
- SystemC分析(2)Method运行机制分析
- DOM选择器
- Linux基础教程
- git命令图解
- Android Design Support Library 八个强大功能的控件
- 关于HTML你可能不知道的一些知识点
- Matlab中的多类别分类