Smallest Subset with Greater Sum || GeeksforGeeks || Problem of the Day

[@Prakhar1701]

class Solution {
int minSubset(int[] arr,int n) {
Arrays.sort(arr);
int i = -1 , j = n;
long s1=0, s2=0;
int count =0;
while(i

[@startercoder]

Simple java solution
class Solution {
int minSubset(int[] Arr,int N) {
long totalsum=0;
int start=0;
long cursum=0;
int length=0;
for(int i=0;i=0;i--){
cursum+=Arr[i];
totalsum-=Arr[i];
length++;
if(cursum>totalsum){
return length;
}
}
return 0;
}
}