https://www.hackerrank.com/challenges/mark-and-toys/problem
Solution: Python
def maximumToys(prices, k):
# sort the prices
prices = sorted(prices)
items = []
for p in prices:
if k >= p:
items.append(p)
k -= p
return len(items)