【杭电2083】The MAX

The MAX

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

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

Recommend

lcy   |   We have carefully selected several similar problems for you:   2807  2802  2804  2800  2816 

 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

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