Marc's Cakewalk

  • + 0 comments

    include

    using namespace std; int main(){ long int n; cin >> n; long long int p = 0; int arr[n]; for(int i = 0; i < n; i++){ cin >> arr[i]; }

    // Sort in descending order
    sort(arr, arr + n, greater<int>());
    
    for(int i = 0; i < n; i++){
        p += pow(2, i) * arr[i];
    }
    
    cout << p;
    
    return 0;
    

    }