Mark_and_Toys.java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

    /*
     * Complete the 'maximumToys' function below.
     *
     * The function is expected to return an INTEGER.
     * The function accepts following parameters:
     *  1. INTEGER_ARRAY prices
     *  2. INTEGER k
     */

    public static int maximumToys(List<Integer> prices, int k) 
    {
      // Write your code here
      
      //if the size is 0..then return 0.. 
      if(prices.size()==0)
      {
          return 0;
      }
      
      //inorder to optimize the solution...(sort the list)..(so that faster the result we can get)..
      Collections.sort(prices);  //sort the list in ascending order.
      
      //now just simply find the sum..and compare whether the sum is less than or equal to k or not..
      int sum=0;
      int i,count=0;  //this count variable will count the number of items which can be bought..
      
      for(i=0;i<prices.size();i++)
      {
          if(sum+prices.get(i)<=k)
          {
              sum = sum + prices.get(i);
              count++;
          }
      }
      return count;
    }
}

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        String[] firstMultipleInput = bufferedReader.readLine().replaceAll("\\s+$", "").split(" ");

        int n = Integer.parseInt(firstMultipleInput[0]);

        int k = Integer.parseInt(firstMultipleInput[1]);

        List<Integer> prices = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

        int result = Result.maximumToys(prices, k);

        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();

        bufferedReader.close();
        bufferedWriter.close();
    }
}