Codeforces Round #134 (Div. 2)——B

来源：互联网发布：java开源系统源码编辑：程序博客网时间：2024/05/19 02:23

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 integersa₁, a₂, ..., 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.

Sample test(s)
input
4 32 1 1
output
5 5
input
4 32 2 2
output
7 6

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.

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define maxn 1005int a[maxn];int cnt[maxn];int main(){    int n,m;    scanf("%d%d",&n,&m);    memset(cnt,0,sizeof(cnt));    for(int i=0; i<m; i++)    {        scanf("%d",&a[i]);        cnt[a[i]]++;    }    int k=1000;    int summax=0;    //找数组里数值最大的减去1，本身的值累加    for(int i=0; i<n;)    {        if(cnt[k])        {            cnt[k]--;            summax+=k;            cnt[k-1]++;            i++;        }        else k--;        if(k==0) break;    }    memset(cnt,0,sizeof(cnt));    for(int i=0; i<m; i++)        cnt[a[i]]++;    int j=0;    int summin=0;    //找数组里数值最小的减去1，本身的值累加    while(j<n)    {        int t=0;        for(k=1; k<=1000; k++)            if(cnt[k])            {                summin+=k;                cnt[k]--;                cnt[k-1]++;                j++;                t=1;                break;            }        if(t==0) break;    }    printf("%d %d\n",summax,summin);    return 0;}