Breaking News: Grepper is joining You.com. Read the official announcement!

def minimulHeaviestSetA(arr,n)

Friendly Flatworm answered on July 25, 2022 Popularity 1/10 Helpfulness 1/10

answer def minimulHeaviestSetA(arr,n)

def minimulHeaviestSetA(arr,n)

Comment

vector<int> minimalHeaviestSetA(vector<int> arr){
    // sort the array arr[] in descending order
    sort(arr.begin(),arr.end(),greater<int>());

    // create array A, sum variable S and Sa
    vector<int> A;
    int S = 0, Sa = 0;

    // store the sum of elements in S
    for(int i=0;i<arr.size();i++) S+=arr[i];

    int i = 0;
    while(i<arr.size() && Sa <= S - Sa){
        Sa += arr[i];
        A.push_back(arr[i]);
        i++;
    }

    // finally return A in increasing order (reverse it)
    reverse(A.begin(),A.end());
    return A;
}

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: www.chegg.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 25 2022

Friendly Flatworm

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

def minimulHeaviestSetA(arr,n)

Contents

More Related Answers

def minimulHeaviestSetA(arr,n)

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.