UVa-10954(Add All)

 

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll n,num;

    while(cin>>n)

    {

        priority_queue< ll, vector<ll>,greater<ll> >q;

        if(n==0) break;

        while(n--) cin>>num,q.push(num);

        ll cur,ans=0;

        while(q.size()>1)

        {

            cur=q.top();

            q.pop();

            cur+=q.top();

            q.pop();

            ans+=cur;

            q.push(cur);

        }

        cout<<ans<<endl;

    }

    return 0;

}

///Alhamdulillah

Problem Link:https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=1895