Mark and Toys Discussions | Algorithms | HackerRank

Mark and Toys

  • + 0 comments

    Java:

    public static int maximumToys(List<Integer> prices, int k) {
        prices.sort(Comparator.naturalOrder());
        int i = 0;
        int totalSpend = 0;
        for (;i < prices.size() && totalSpend < k; ++i) {
            totalSpend += prices.get(i);
        }
        return i-1;
    }