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

using namespace std;


// 10 5
int main()
{
    int n, k, a = 0, b = 0, as, bs, am, bm;
    int ab = 0;
    vector<int> S;
    cin >> n >> k;
    S.resize(n);
    for(int i = 0; i < n; i++)
    {
        cin >> S[i];
    }
    sort(S.begin(), S.end());
    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 && (ab == 1 || ab == 0))
            {
                am = sum + a;
                bm = b;
                ab = 1;
            }
            a+=S[i];
        }
        else
        {
            if(sum + b > bs && (ab == 2 || ab == 0))
            {
                bm = sum + b;
                am = a;
                ab = 2;
            }
            b+=S[i];
        }
        sum-=S[i];
    }
    cout << am << " " << bm;
    return 0;
}