CF1042A.Benches

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

There are $n$ benches in the Berland Central park. It is known that $a_i$ people are currently sitting on the $i$ -th bench. Another $m$ people are coming to the park and each of them is going to have a seat on some bench out of $n$ available.

Let $k$ be the maximum number of people sitting on one bench after additional $m$ people came to the park. Calculate the minimum possible $k$ and the maximum possible $k$ .

Nobody leaves the taken seat during the whole process.

输入格式

The first line contains a single integer $n$ $(1 \le n \le 100)$ — the number of benches in the park.

The second line contains a single integer $m$ $(1 \le m \le 10\,000)$ — the number of people additionally coming to the park.

Each of the next $n$ lines contains a single integer $a_i$ $(1 \le a_i \le 100)$ — the initial number of people on the $i$ -th bench.

输出格式

Print the minimum possible $k$ and the maximum possible $k$ , where $k$ is the maximum number of people sitting on one bench after additional $m$ people came to the park.

输入输出样例

输入#1
```
4
6
1
1
1
1
```
输出#1
```
3 7
```
输入#2
```
1
10
5
```
输出#2
```
15 15
```
输入#3
```
3
6
1
6
5
```
输出#3
```
6 12
```
输入#4
```
3
7
1
6
5
```
输出#4
```
7 13
```

说明/提示

In the first example, each of four benches is occupied by a single person. The minimum $k$ is $3$ . For example, it is possible to achieve if two newcomers occupy the first bench, one occupies the second bench, one occupies the third bench, and two remaining — the fourth bench. The maximum $k$ is $7$ . That requires all six new people to occupy the same bench.

The second example has its minimum $k$ equal to $15$ and maximum $k$ equal to $15$ , as there is just a single bench in the park and all $10$ people will occupy it.

首页