HDOJ 2803 The MAX(数学规律)

The MAX

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

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

ac代码：

   
   
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define LL long long
#define MAXN 1000
using namespace std;
LL num[MAXN];
int main()
{
    int i,n;
    while(scanf("%d",&n)!=EOF,n)
    {
        for(i=0;i<n;i++)
        scanf("%d",&num[i]);
        sort(num,num+n);
        LL ans=0;
        for(i=0;i<n-1;i++)
        ans+=num[i];
        ans+=(num[n-1]*(2010-n));
        printf("%lld\n",ans);
    }
    return 0;
}