package com.fishercoder.solutions;

import java.util.Arrays;

/**
 * 1196. How Many Apples Can You Put into the Basket
 *
 * You have some apples, where arr[i] is the weight of the i-th apple.  You also have a basket that can carry up to 5000 units of weight.
 * Return the maximum number of apples you can put in the basket.
 *
 * Example 1:
 * Input: arr = [100,200,150,1000]
 * Output: 4
 * Explanation: All 4 apples can be carried by the basket since their sum of weights is 1450.
 *
 * Example 2:
 * Input: arr = [900,950,800,1000,700,800]
 * Output: 5
 * Explanation: The sum of weights of the 6 apples exceeds 5000 so we choose any 5 of them.
 *
 * Constraints:
 * 1 <= arr.length <= 10^3
 * 1 <= arr[i] <= 10^3
 * */
public class _1196 {
    public static class Solution1 {
        public int maxNumberOfApples(int[] arr) {
            Arrays.sort(arr);
            int sum = 0;
            int i = 0;
            for (; i < arr.length; i++) {
                if (sum + arr[i] < 5000) {
                    sum += arr[i];
                } else {
                    break;
                }
            }
            return i;
        }
    }
}

@@ -965,34 +965,22 @@
     
-if (
 sum +
+=
  arr%5Bi%5D
- %3C 5000) %7B
+;
 %0A   
@@ -996,49 +996,23 @@
     
-    sum += arr%5Bi%5D;%0A                %7D else
+if (sum %3E 5000)
  %7B%0A 

refactor 1196