solves minimum subsequence in non increasing order

Author: anishLearnsToCode

Diff for: README.md

@@ -356,7 +356,7 @@
 | 1389 | [Create Target Array in Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order)                                           |                                                          [![Java](assets/java.png)](src/CreateTargetArrayInGivenOrder.java)                                                          |                                                                                                                                   |
 | 1394 | [Find Lucky Integer In An Array](https://leetcode.com/problems/find-lucky-integer-in-an-array)                                                       |                                                          [![Java](assets/java.png)](src/FindTheLuckyIntegerInAnArray.java)                                                           |                                                                                                                                   |
 | 1399 | [Count Largest Group](https://leetcode.com/problems/count-largest-group)                                                                             |                                                                [![Java](assets/java.png)](src/CountLargestGroup.java)                                                                |                                                                                                                                   |
-| 1403 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)                             |                                                                                                                                                                                      |                                                                                                                                   |
+| 1403 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)                             |                                                     [![Java](assets/java.png)](src/MinimumSubSequenceInNonIncreasingOrder.java)                                                      |                                                                                                                                   |
 | 1408 | [String Matching In An Array](https://leetcode.com/problems/string-matching-in-an-array)                                                             |                                                                                                                                                                                      |                                                                                                                                   |
 | 1413 | [Minimum Value To Get Positive Step By Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)                       |                                                                                                                                                                                      |                                                                                                                                   |
 | 1417 | [Reformat The String](https://leetcode.com/problems/reformat-the-string)                                                                             |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/MinimumSubSequenceInNonIncreasingOrder.java

@@ -0,0 +1,18 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class MinimumSubSequenceInNonIncreasingOrder {
+    public List<Integer> minSubsequence(int[] array) {
+        Arrays.sort(array);
+        final int sum = Arrays.stream(array).sum();
+        final List<Integer> result = new ArrayList<>();
+        result.add(array[array.length - 1]);
+        for (int index = array.length - 2, current = array[array.length - 1] ; index >= 0 ; index--) {
+            if (current > sum - current) break;
+            current += array[index];
+            result.add(array[index]);
+        }
+        return result;
+    }
+}