杭电 2803 The MAX（sort）

Description

Giving N integers, V1, V2,,,,Vn, you should find the biggest value of F. 

Input

Each test case contains a single integer N (1<=N<=100). The next line contains N integers, meaning the value of V1, V2....Vn.(1<= Vi <=10^8).The input is terminated by a set starting with N = 0. This set should not be processed.

 

Output

For each test case, output the biggest value of F you can find on a line.

 

Sample Input

2

1 2

0

Sample Output

4017

 

 #include<cstdio>
 #include<algorithm>
 using namespace std;
 int a[];
 int main()
 {
     __int64 n,j;
     while(scanf("%I64d",&n)&&n)
     {
         for(__int64 i=;i<n;i++)
         {
             scanf("%d",&a[i]);
         }
         sort(a,a+n);
         j=a[n-]*(-n);
         for(__int64 i=;i < n; i++)
         j=j+a[n--i];
         printf("%I64d\n",j);
     }
 }