hdoj The MAX 2803 （简单计算）

The MAX

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

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

2 1 2 0

Sample Output

4017

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