update

leetcode/problem/minimum-subsequence-in-non-increasing-order.html

@@ -0,0 +1,37 @@
+<p>Given the array <code>nums</code>, obtain a subsequence of the array whose sum of elements is <strong>strictly greater</strong> than the sum of the non&nbsp;included elements in such subsequence.&nbsp;</p>
+
+
+
+<p>If there are multiple solutions, return the subsequence with <strong>minimum size</strong> and if there still exist multiple solutions, return the subsequence with the <strong>maximum total sum</strong> of all its elements. A subsequence of an array can be obtained by erasing some (possibly zero) elements from the array.&nbsp;</p>
+
+
+
+<p>Note that the solution with the given constraints is guaranteed to be&nbsp;<strong>unique</strong>. Also return the answer sorted in <strong>non-increasing</strong> order.</p>
+
+
+
+<p>&nbsp;</p>
+
+<p><strong>Example 1:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [4,3,10,9,8]
+
+<strong>Output:</strong> [10,9] 
+
+<strong>Explanation:</strong> The subsequences [10,9] and [10,8] are minimal such that the sum of their elements is strictly greater than the sum of elements not included, however, the subsequence [10,9] has the maximum total sum of its elements.&nbsp;
+
+</pre>
+
+
+
+<p><strong>Example 2:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [4,4,7,6,7]