hdu 2803 The MAX【贪心】

The MAX

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2051 Accepted Submission(s): 888

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
  
  

看懂题意就能秒，注意数据范围会超 int 

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{
	int n; ll x[105],sum;
	while(scanf("%d",&n),n)
	{
		for(int i=0;i<n;++i)
		{
			scanf("%lld",&x[i]);
		}
		sort(x,x+n);
		sum=(2009-n+1)*x[n-1];
		for(int i=n-2;i>=0;--i)
		{
			sum+=x[i];
		}
		printf("%lld\n",sum);
	}
	return 0;
}