【CodeForces - 1042A】Benches （优先队列，思维模拟，maxmin问题）

题干：

There are nn benches in the Berland Central park. It is known that aiai people are currently sitting on the ii-th bench. Another mm people are coming to the park and each of them is going to have a seat on some bench out of nn available.

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

Nobody leaves the taken seat during the whole process.

Input

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

The second line contains a single integer mm (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 aiai (1≤ai≤100)(1≤ai≤100) — the initial number of people on the ii-th bench.

Output

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

Examples

Input

Output

3 7

Input

1
10
5

Output

15 15

Input

Output

6 12

Input

Output

7 13

Note

In the first example, each of four benches is occupied by a single person. The minimum kk is 33. 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 kk is 77. That requires all six new people to occupy the same bench.

The second example has its minimum kk equal to 1515 and maximum kk equal to 1515, as there is just a single bench in the park and all 1010 people will occupy it.

解题报告：

maxx很好弄，全加在那个最大的上就可以了。（也就是最大可能的最大值）

主要是minn：（最小可能的最大值）

这题做法很多，可以直接优先队列模拟，这种题见过很多个了。

还有一个方法，因为要输出最小的最大值，所以直接看看能不能把其余的都变成最大的，然后剩下的再均摊。如果不够都变成最大的，那最大的那个就是答案。

刚开始有一个错误的想法，就是上来就平均分，然后剩余的多的再加到最小的身上。这样错误想法的产生，就是因为没有注意到答案的特点：肯定要大于等于那个最大的。

AC代码：

#include<bits/stdc++.h>using namespace std;
int n,m;
int a[1000 + 5];
priority_queue<int,vector<int>,greater<int> > pq;
int main()
{cin>>n>>m;for(int i = 1; i<=n; i++) scanf("%d",a+i),pq.push(a[i]);sort(a+1,a+n+1);int maxx = a[n] + m;int minn = 0;for(int i = 1 ; i<=m; i++) {int cur = pq.top();pq.pop();pq.push(cur+1);}for(int i = 1; i<=n; i++) {minn = max(minn,pq.top());pq.pop();}printf("%d %d\n",minn,maxx);return 0;
}

当时的错误想法：

//   for(int i = 1; i<=n; i++) a[i]+=(m/n);
//  m%=n;
//  for(int i = 1; i<=m; i++) a[i]++;
//  minn = *max_element(a+1,a+n+1);

总结：先分析清楚问题，再动手敲代码。

【CodeForces - 1042A】Benches （优先队列，思维模拟，maxmin问题）相关推荐

Magic Powder - 1 CodeForces - 670D1（优先队列进一步理解）
写这个题的时候一直在想怎么才能动态排序(一遍改变数值,一遍从新改变相应的顺序),到最后才突然想起来这不就是优先队列吗,通过这题对优先队列的动态排序有了进一步理解.好题! AC代码: #include ...
SDU程序设计思维实践题目总结
题目来源及链接题目名称及讲解博客链接涉及算法原题以及原题链接第二周作业 Maze BFS POJ-3984 Pour water BFS POJ-1606 第二周实验化学模拟 codefo ...
Codeforces Round #FF (Div. 2) D. DZY Loves Modification 贪心+优先队列
链接:http://codeforces.com/problemset/problem/447/D 题意:一个n*m的矩阵.能够进行k次操作,每次操作室对某一行或某一列的的数都减p,获得的得分是这一行 ...
贪心(优先队列) - New Year Snowmen - CodeForces - 140C
贪心(优先队列) - New Year Snowmen - CodeForces - 140C 题意: 给定一个长度为n的正整数序列a1,a2,...,an.给定一个长度为n的正整数序列a_1,a_2 ...
【CodeForces - 1038C】Gambling （博弈问题，优先队列模拟，贪心）
题干: Two players A and B have a list of nn integers each. They both want to maximize the subtraction ...
*【CodeForces - 574A】Bear and Elections （优先队列，水题模拟）
题干: Limak is a grizzly bear who desires power and adoration. He wants to win in upcoming elections a ...
CodeForces 140C New Year Snowmen （贪心+优先队列）
题意:n个数,选三个严格下降的数为一组,求最多能选多少组,并列出每组哪些数. 题解:贪心+优先队列最多能选多少组,那么必须贪心数量多的. 例如:1 1 2 3 4 5 如果按照数的大小排序,只能贪到 ...
Potions CodeForces - 1526C1/1526C2（优先队列）
Potions(Easy Version) Potions(Hard Version) 题意: 从左往右喝药,在保证自己的生命值hp>0的情况下,尽可能喝更多的药思路: 碰到加hp的,就可以喝 ...
Codeforces Raif Round 1 (Div. 1 + Div. 2) E. Carrots for Rabbits（优先队列+贪心）
原题链接题意有N个萝卜,K只兔子,要求把N个萝卜分成K份,一个兔子吃一个长为X的萝卜的时间为X*X,求怎么分能使最后的时间最短. 思路刚看到这个题的时候,刚开始的思路是,把所有的萝卜都存在一个大 ...

【CodeForces - 1042A】Benches （优先队列，思维模拟，maxmin问题）

【CodeForces - 1042A】Benches （优先队列，思维模拟，maxmin问题）相关推荐

最新文章

热门文章