HDOJ 2803 The MAX【水题】

最新推荐文章于 2016-07-18 17:54:26 发布

非常可乐（이녕）

最新推荐文章于 2016-07-18 17:54:26 发布

阅读量315

点赞数

分类专栏：题文章标签： hdoj

本文链接：https://blog.csdn.net/wyjwyl/article/details/49560263

版权

题专栏收录该内容

47 篇文章 0 订阅

订阅专栏

The MAX

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

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

恩，题目大意就是说，给 n 个数，然后求与 n 个对应的数相乘之和的最大值，这 n 个对应的数之和小于等于2009 。刚开始一看题以为不简单就没写，之后回头来想了想，没想到真的就是这样的。。。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 110
using namespace std;
__int64 rec[maxn];
int main()
{
    int n;
    __int64 sum;
    while(scanf("%d",&n)&&n)
    {
        sum=0;
        for(int i=0;i<n;++i)
            scanf("%I64d",&rec[i]);
        sort(rec,rec+n);
        for(int i=0;i<n-1;++i)
        {
            sum+=rec[i];
        }
        sum+=rec[n-1]*(2009-n+1);
        printf("%I64d\n",sum);
    }
    return 0;
}