Minimum Subsequence in Non-Increasing Order

Given an array of integers nums, find the minimum subsequence of the array such that the sum of the subsequence is strictly greater than the sum of the non-included elements.

Ada AI

I want to discuss a solution

Help me solve this

Give more examples

What's wrong with my code?

How to use 'for loop' in javascript?

javascript (node 13.12.0)

Stdin (editable)

Minimum Subsequence in Non-Increasing Orderself.__wrap_b(":R159l76:",1)

Minimum Subsequence in Non-Increasing Order