The MAX
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2047 Accepted Submission(s): 887
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
看上去很唬人,水得不是一般。
代码如下:
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n,i;
__int64 a[110],sum;
while(scanf("%d",&n)&&n)
{
for(i=0;i<n;++i)
scanf("%I64d",&a[i]);
sort(a,a+n);
sum=a[n-1]*(2010-n);
for(i=0;i<n-1;++i)
sum+=a[i];
printf("%I64d\n",sum);
}
return 0;
}