Summary

Question

Small W is playing a summary game. Firstly, He takes N numbers. Secondly he takes out every pair of them and add this two numbers, thus he can get N*(N - 1)/2 new numbers. Thirdly he deletes the repeated number of the new numbers. Finally he gets the sum of the left numbers. Now small W want you to tell him what is the final sum.

Input

Multi test cases, every case occupies two lines, the first line contain n, then second line contain n numbers a 1, a 2, ……a n separated by exact one space. Process to the end of file.
TechnicalSpecificationTechnicalSpecification
2 <= n <= 100
-1000000000 <= a i <= 1000000000

Output

For each case, output the final sum.

Simple input

4
1 2 3 4
2
5 5

Simple output

25
10

Hint

Firstly small W takes any pair of 1 2 3 4 and add them, he will get 3 4 5 5 6 7. Then he deletes the repeated numbers, he will get 3 4 5 6 7, Finally he gets the sum=3+4+5+6+7=25.

Code

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n,i,j,k;
    long long int m,t;
    long long int a[101],b[10001];
    while(cin>>n)
    {
        m=0,k=0;
        for(i=0;i<n;i++)
        {
            cin>>a[i];
        }
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
            {
                b[k]=a[i]+a[j];
                k++;
            }
        }
        sort(b,b+(n-1)*n/2);//对sum排序
        t=b[0],m=b[0];
        for(i=1;i<(n-1)*n/2;i++)
            if(b[i]>t)
            {
                m=m+b[i];
                t=b[i];
            }
        cout<<m<<endl;
    }

    return 0;
}