hdu--2803 The MAX（sort排序）

The MAX（sort）

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 
     
     

注意：数据类型为long long否者会出错

代码；

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	long long a[110];
	while(scanf("%d",&n)&&n)
	{
		long long sum=0;
		for(int i=0;i<n;i++)
		{
			scanf("%lld",&a[i]);
		}
		sort(a,a+n);
		for(int i=0;i<n-1;i++)
		{
			sum+=a[i];
		}
		sum+=(2010-n)*a[n-1];
		printf("%lld\n",sum);
	}
	return 0;
}