E - 1005

最新推荐文章于 2023-03-27 12:03:16 发布

sdau20163940

最新推荐文章于 2023-03-27 12:03:16 发布

阅读量364

点赞数

分类专栏： 2017年省赛赛前训练赛

本文链接：https://blog.csdn.net/sinat_37668729/article/details/68962504

版权

2017年省赛赛前训练赛专栏收录该内容

57 篇文章 0 订阅

订阅专栏

Description

Sergey takes part in a TV show «Battle of Prophets», in another episode of which the task of the participants is guessing the colors of the balls taken by the show host out of the opaque urn. Using a spirit ritual he found out that the urn contains balls of n different colors, and the number of balls of the i-th color is exactly a_i. The show host is planning to take out balls one by one until the urn becomes empty, and Sergey will have to say the ball's color every time before it is taken out. Unfortunately, the ancient spirits refuse to help him, and he has to trust his intuition only. Sergey wants to guess the color of as many balls as possible in the worst case and is now thinking how many times he is able to make a correct guess for sure.

Input

The first line contains a single integer n (1 ≤ n ≤ 2·10⁵) — the number of different colors.

The second line contains n space-separated integers: a_i (1 ≤ a_i ≤ 10⁹) — the number of balls of the i-th color in the urn.

Output

Output a single integer — the maximal number of balls whose color Sergey can definitely guess.

Sample Input

Input

4
5 2 2 9

Output

Input

3
1 2 1

Output

题意：

感觉题目就是个坑，前面说的都是无用的话，其实就是让输出一个最大的数！

心得;

有些题目其实问题描述看似非常复杂，但仔细分析便可发现有的题非常简单！

代码：

#include <iostream>
using namespace std;
int main()
{
    int i,j,k,n,max;
    int a[200001];
    while(cin>>n)
    {
        for(i=0;i<n;i++)
        {
            cin>>a[i];
        }
        max=0;
        for(i=0;i<n;i++)
        {
            if(a[i]>max)
            {
                max=a[i];
            }
        }
        cout<<max<<endl;
    }return 0;
}