O(n) solution exists

#include <iostream>
using namespace std;
int main()
{
   int n,c;
   cin>>n;
   int a[n];
   for(int i=0;i<n;i++)
     cin>>a[i];
   for(int i=0;i<n;i++){
     for(int j=0;j<n;j++)
      if(a[i]<a[j]){c=a[i];a[i]=a[j];a[j]=c;}
     }
      c=a[n-1];
     for(int i=0;i<n;i++)
     c=c+a[i];
     cout<<c;
    return 0;
}

Edited by author 25.03.2022 06:30

give me this test please..

Just sort it, before your solution.

What is the answer for the test case
6
1 3 2 5 4 6

Simple try to find the biggest and double it, then find the sum. Good luck.

Edited by author 14.02.2013 22:59