Codeforces Round 134 (Div. 2)
B
Airport
Codeforces
1100
原题
← AC →
翻译中…

Lolek and Bolek are about to travel abroad by plane. The local airport has a special "Choose Your Plane" offer. The offer's conditions are as follows:

翻译中…
  • it is up to a passenger to choose a plane to fly on;
  • if the chosen plane has $*x*$ $(*x* > 0)$ empty seats at the given moment, then the ticket for such a plane costs $*x*$ zlotys (units of Polish currency).
翻译中…

The only ticket office of the airport already has a queue of $*n*$ passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all $*n*$ passengers buy tickets according to the conditions of this offer?

翻译中…

The passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to $*n*$-th person.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*m*$ $(1 ≤ *n*, *m* ≤ 1000)$ — the number of passengers in the queue and the number of planes in the airport, correspondingly. The next line contains $*m*$ integers $*a*_{1}, *a*_{2}, ..., *a*_{*m*}$ $(1 ≤ *a*_{*i*} ≤ 1000)$ — $*a*_{*i*}$ stands for the number of empty seats in the $*i*$-th plane before the ticket office starts selling tickets.

翻译中…

The numbers in the lines are separated by a space. It is guaranteed that there are at least $*n*$ empty seats in total.

翻译中…

Output

翻译中…

Print two integers — the maximum and the minimum number of zlotys that the airport administration can earn, correspondingly.

翻译中…

Note

翻译中…

In the first test sample the number of passengers is equal to the number of empty seats, so regardless of the way the planes are chosen, the administration will earn the same sum.

翻译中…

In the second sample the sum is maximized if the 1-st person in the queue buys a ticket to the 1-st plane, the 2-nd person — to the 2-nd plane, the 3-rd person — to the 3-rd plane, the 4-th person — to the 1-st plane. The sum is minimized if the 1-st person in the queue buys a ticket to the 1-st plane, the 2-nd person — to the 1-st plane, the 3-rd person — to the 2-nd plane, the 4-th person — to the 2-nd plane.

翻译中…

样例

Input #1
4 3
2 1 1
Output #1
5 5
InputCopy OutputCopy
Input #2
4 3
2 2 2
Output #2
7 6
InputCopy OutputCopy
题目信息
题号
218B
时间限制
2 s
内存限制
256 MB
标签
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。