218B.cpp

#include <bits/stdc++.h>
#define mod 1000000007
#define FOR(i, a, b) for (i = a; i < b; i++)
#define FastIO                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef priority_queue<ll, vector<ll>, greater<ll>> minheap;
typedef priority_queue<ll> maxheap;
int dxrow[] = {-1, 0, 0, 1, 1, 1, -1, -1}; //first 4 straight last 4 diagonals
int dycol[] = {0, -1, 1, 0, 1, -1, -1, 1};
void printV(vector<ll> v)
{
    for (ll i = 0; i < v.size(); i++)
        cout << v[i] << "\n";
}
ll power(ll a, ll b)
{
    return (ll)(pow(a, b) + 0.5);
}
int modexp(ll A, ll B, ll C)
{
    if (A == 0)
        return 0;
    if (B == 0)
        return 1;
    ll y;
    if (B % 2 == 0)
    {
        y = modexp(A, B / 2, C);
        y = (y * y) % C;
    }
    else
    {
        y = A % C;
        y = (y * modexp(A, B - 1, C) % C) % C;
    }

    return (ll)((y + C) % C);
}
int main()
{
    ll n, m, x, i;
    cin >> n >> m;
    ll a[m];
    minheap minx;
    maxheap maxx;
    FOR(i, 0, m)
    {
        cin >> x;
        minx.push(x);
        maxx.push(x);
    }
    ll mina = 0, maxa = 0;
    FOR(i, 1, n + 1)
    {
        ll k = minx.top();
        ll k2 = maxx.top();
        mina += k;
        maxa += k2;
        minx.pop();
        maxx.pop();
        if (k != 1)
            minx.push(k - 1);
        if (k2 != 1)
            maxx.push(k2 - 1);
    }
    cout << maxa << " " << mina;
}