hdoj2803The MAX

The MAX

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

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
  
  

 

Source

HDU 2009-4 Programming Contest

 

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
long long MAX(long long a,long long b){
	return a>b?a:b;
}
int main()
{
	int n,i,j,k;
	while(scanf("%d",&n),n){
		long long max=0,a,sum=0;
		for(i=0;i<n;++i){
			scanf("%lld",&a);
			sum+=a;
			max=MAX(a,max);
		}
		printf("%lld\n",sum-max+max*(2009-n+1));
	}
	return 0;
}