The MAX
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 957 Accepted Submission(s): 439
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
随便猜了个结论:
最大的数去乘以2010-n
最大的数去乘以2010-n
其他的都乘以1
然后求和
果断1Y。。太水了
我的代码:
#include<stdio.h>
#include<algorithm>
using namespace std;
__int64 a[105];
int main()
{
__int64 n,i,ans;
while(scanf("%I64d",&n)!=EOF)
{
if(n==0)
break;
ans=0;
for(i=1;i<=n;i++)
scanf("%I64d",&a[i]);
sort(a+1,a+1+n);
for(i=1;i<=n-1;i++)
ans=ans+a[i];
ans=ans+a[n]*(2010-n);
printf("%I64d\n",ans);
}
return 0;
}