Problem 086 Max Toys, Greedy Algorithm

Author: jeanbou

HackerRank/Java/Problem_Solving/Problem086_Mark_andToys__GreedyAlgorithm.java

@@ -0,0 +1,58 @@
+package hackerRank_JavaProblemSolving;
+
+import java.io.BufferedWriter;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Problem086_Mark_andToys__GreedyAlgorithm {
+
+ // IDEAS: Stupid greedy algorithm
+ static int maximumToys(int[] prices, int k) {
+ Arrays.sort(prices);
+ int sum = 0;
+ int counter = 0;
+ for (int p : prices) {
+ sum += p;
+ counter++;
+ if ( sum > k ) {
+ counter--;
+ break;
+ }
+ }
+ return counter;
+ } // maximumToys
+
+ 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();
+ }
+}
+