Day 6: Mark and his Toys
Submissions will no longer be placed on the leaderboard. You may still attempt this problem for practice.
Mark and Jane are very happy after having their first kid, and Mark wants to buy some toys for him. There are different toys, tagged with their prices, but he has only . He wants to buy the maximum number of toys for his son.
You are Mark's best friend and have to help him buy as many toys as possible.
Input Format
The first line contains two integers, and separated by a space.
The next line contains space separated integers indicating the price of each toy.
Output Format
Output an integer that denotes the maximum number of toys Mark can buy with .
Constraints
A toy can't be bought multiple times.
Sample Input
7 50
1 12 5 111 200 1000 10
Sample Output
4
Explanation
He can buy only toys at the most. These toys have the following prices: .
xxxxxxxxxx15
1
function processData(input) {2
//Enter your code here3
} 4
5
process.stdin.resume();6
process.stdin.setEncoding("ascii");7
_input = "";8
process.stdin.on("data", function (input) {9
_input += input;10
});11
12
process.stdin.on("end", function () {13
processData(_input);14
});15
