杭电-2803The MAX

最新推荐文章于 2024-08-03 14:51:53 发布

原创最新推荐文章于 2024-08-03 14:51:53 发布 · 517 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#杭电 #2803 #The MAX

HDU—ACM 同时被 2 个专栏收录

82 篇文章

订阅专栏

数学

20 篇文章

订阅专栏

The MAX

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

Total Submission(s): 2058 Accepted Submission(s): 894

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

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