A11969 | Benches
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
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.
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted