hd 1803 The MAX（sort）

                                                        The MAX

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2300    Accepted Submission(s): 1009

Problem 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

21 20

 

Sample Output

4017

 

<span style="font-size:14px;">#include<cstdio>#include<cstring>#include<algorithm>using namespace std;bool cmp(int a,int b){return a>b;}int main(){    int n;    long long a[110];    while(scanf("%d",&n)!=EOF)    {    if(n==0) break;long long sum=0;    for(int i=0;i<n;i++)       scanf("%lld",&a[i]);    sort(a,a+n,cmp);    sum=a[0]*(2010-n);    for(int i=1;i<n;i++)       sum+=a[i];    printf("%lld\n",sum);}return 0;}</span>