【杭电oj】2803 - The MAX（水）-优快云博客

本文介绍了一道算法题目，要求在给定整数数组的情况下找到最大的F值。通过输入一组不超过100个的正整数，使用特定算法进行处理，并输出结果。示例中展示了如何使用C++实现快速排序并计算目标值。

The MAX

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

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

Sample Output

Source

HDU 2009-4 Programming Contest

题意看懂就挺水了。

代码如下：

#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	int v[100+11];
	__int64 ans;
	while (~scanf ("%d",&n) && n)
	{
		for (int i = 0 ; i < n ; i++)
			scanf ("%d",&v[i]);
		sort (v , v + n);
		ans = 0;
		for (int i = 0 ; i < n - 1 ; i++)
			ans += v[i];
		ans += (2010 - n) * (__int64)v[n-1];
		printf ("%I64d\n",ans);
	}
	return 0;
}