Hangzhou Electric 2803 The MAX (sort)

descriptiongiving N integers, V1, V2,,,, Vn, you should find the biggest value of F.
Inputeach 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 is processed. Outputfor each test case, output the biggest value of F can find on a line. Sample Input21 Sample Output4017

1#include <cstdio>2#include <algorithm>3 using namespacestd;4 inta[100000];5 intMain ()6 {7 __int64 n,j;8      while(SCANF ("%i64d", &n) &&N)9     {Ten          for(__int64 i=0; i<n;i++) One         { Ascanf"%d",&a[i]); -         } -Sort (a,a+n); thej=a[n-1]*( .-n); -          for(__int64 i=1; i < n; i++) -j=j+a[n-1-i]; -printf"%i64d\n", j); +     } -}

Hangzhou Electric 2803 The MAX (sort)