Benches

Description:
There are n benches in the Berland Central park. It is known that ai 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.

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

The second line contains a single integer m (1≤m≤10000)(1≤m≤10000) — the number of people additionally coming to the park.

Each of the next nn lines contains a single integer ai (1≤ai≤100)(1≤ai≤100) — the initial number of people on the i-th bench.

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

Examples
Input
4
6
1
1
1
1
Output
3 7

Input
1
10
5
Output
15 15

Input
3
6
1
6
5
Output
6 12

Input
3
7
1
6
5
Output
7 13

Note
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.

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
int num[110];
int main(){
	memset(num,0,sizeof(num));
	int n,a;
	cin>>n>>a;
	int tol=0; 
	for(int i=0;i<n;i++){
		cin>>num[i];
		tol+=num[i];
	}
	sort(num,num+n);
	int kmax=a+num[n-1];//最大可能的k就是原始凳子上人最多的加上所有要来的人
	int kmin=(tol+a)/n;//最小可能的k就是所有人之和除凳子个数，也就是平均分配
	if((tol+a)%n)//除不尽取大的
		kmin++;
	if(kmin<num[n-1])//如果平均分下来比开始凳子上最多的人数小，取num[n-1]
		kmin=num[n-1]; 
	cout<<kmin<<" "<<kmax<<endl;
	return 0; 
} 

应该要养成思考是否有特殊情况的习惯，本来没有考虑到平均分配会比开始凳子上最多的人数少的情况，当然肯定wa，而这时考虑哪里错了就特别难，现在觉得一个一个考虑比较容易，最大的肯定没问题，那么最小的情况就多列举几个。