hdoj--2803--The MAX（水题）

The MAX

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

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

同样的代码，不一样的提交时间，咋就这么坑呢，坑了我一早上，都快哭了，这麽一道水题，唉~~~

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

 

转载于:https://www.cnblogs.com/playboy307/p/5273763.html