#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n, k;
    long long a = 0, b = 0, as, bs;
    vector<int> S;
    cin >> n >> k;
    S.resize(n);
    for(int i = 0; i < n; i++)
    {
        cin >> S[i];
    }
    sort(S.begin(), S.end());
    if(n == 2)
    {
        cout << S[1] << " " << S[0];
        return 0;
    }
    for(int i = n - 1; i >= k; i--)
    {
        if(i % 2 != n % 2)
        {
            a+=S[i];
        }
        else
        {
            b+=S[i];
        }
    }
    as = a;
    bs = b;
    for(int i = k - 1; i >= 0; i--)
    {
        if(i % 2 != n % 2)
        {
            as+=S[i];
        }
        else
        {
            bs+=S[i];
        }
    }
    int sum = as + bs - a - b;
    for(int i = k - 1; i >= 0; i--)
    {
        if(i % 2 != n % 2)
        {
            if(sum + a > as)
            {
                a = sum + a;
                break;
            }
            a+=S[i];
        }
        else
        {
            if(sum + b > bs)
            {
                b = sum + b;
                break;
            }
            b+=S[i];
        }
        sum-=S[i];
    }
    cout << a << " " << b;
    return 0;
}