@@ -0,0 +1,1375 @@
+import java.io.*;%0Aimport java.math.*;%0Aimport java.security.*;%0Aimport java.text.*;%0Aimport java.util.*;%0Aimport java.util.concurrent.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    // Complete the maximumToys function below.%0A    static int maximumToys(int%5B%5D prices, int k) %7B%0A        Arrays.sort(prices);%0A        int count = 0;%0A        for(int i=0;i%3Cprices.length;i++)%7B%0A            k-=prices%5Bi%5D;%0A            count++;%0A            if(k%3C0) break;%0A        %7D%0A        return count-1;%0A    %7D%0A%0A    private static final Scanner scanner = new Scanner(System.in);%0A%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(%22OUTPUT_PATH%22)));%0A%0A        String%5B%5D nk = scanner.nextLine().split(%22 %22);%0A%0A        int n = Integer.parseInt(nk%5B0%5D);%0A%0A        int k = Integer.parseInt(nk%5B1%5D);%0A%0A        int%5B%5D prices = new int%5Bn%5D;%0A%0A        String%5B%5D pricesItems = scanner.nextLine().split(%22 %22);%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        for (int i = 0; i %3C n; i++) %7B%0A            int pricesItem = Integer.parseInt(pricesItems%5Bi%5D);%0A            prices%5Bi%5D = pricesItem;%0A        %7D%0A%0A        int result = maximumToys(prices, k);%0A%0A        bufferedWriter.write(String.valueOf(result));%0A        bufferedWriter.newLine();%0A%0A        bufferedWriter.close();%0A%0A        scanner.close();%0A    %7D%0A%7D%0A

add MarkAndToys.java