HDU-2803

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

• 题意：给一个公式，给一组数字，求出公式的最大值。思路：这里很明显就是找到给出的一些列数字中的最大值，分配给它最多的数字，其它的数字全部乘1即可。
• AC Code

  #include <cstdio>
  #include <algorithm>
  using namespace std;
  long long a[110];
  int main()
  {
      int N;
      while(~scanf("%d",&N) && N)
      {
          for(int i=0;i<N;++i)
          {
              scanf("%lld",&a[i]);
          }
          sort(a,a+N);
          long long res=0;
          for(int i=0;i<N-1;++i) 
  		{
  			res = res + a[i]; 
  		}         
          res = res + a[N-1]*(2009-N+1);
          printf("%lld\n",res);
          
      }
      return 0;
  }