Solutions to Sorting section

Interview Preparation Kit/Sorting/Mark and Toys/Solution.java

@@ -0,0 +1,49 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    static int maximumToys(int[] prices, int k) {
+        Arrays.sort(prices);
+
+        int numToys = 0;
+        for (int price : prices) {
+            if (price <= k) {
+                numToys++;
+                k = k - price;
+            } else {
+                break;
+            }
+        }
+        return numToys;
+    }
+
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) throws IOException {
+        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
+
+        String[] nk = scanner.nextLine().split(" ");
+
+        int n = Integer.parseInt(nk[0]);
+        int k = Integer.parseInt(nk[1]);
+
+        int[] prices = new int[n];
+        String[] pricesItems = scanner.nextLine().split(" ");
+
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+        for (int i = 0; i < n; i++) {
+            int pricesItem = Integer.parseInt(pricesItems[i]);
+            prices[i] = pricesItem;
+        }
+
+        int result = maximumToys(prices, k);
+
+        bufferedWriter.write(String.valueOf(result));
+        bufferedWriter.newLine();
+
+        bufferedWriter.close();
+        scanner.close();
+    }
+}