Mark and Toys Discussions | Algorithms | HackerRank

Mark and Toys

  • + 0 comments

    Java

    	Collections.sort(prices);
            int sum = 0;
            int count = 0;
            for(Integer i : prices){
                sum += i;
                if(sum > k){
                    break;
                } else{
                    count++;
                }
            }
            return count;