#include <iostream>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main()
{
    ll n, k; cin >> n >> k;
    vector<ll> v(n);
    for (ll i = 0; i < n; i++){
        cin >> v[i];
    }

    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    ll a = 0, b = 0;
    for (ll i = 0; i < n-k; i++){
        if (i % 2 == 0) a += v[i];
        else b += v[i];
    }
    ll sum = 0;
    for (ll i = n-k; i < n; i++){
        sum += v[i];
    }
    for (ll i = n-k; i < n; i++){
        if (i % 2 == 0){
            a += max(v[i], sum);
        }
        else {
            b += max(v[i], sum);
        }
        if (sum > v[i]) break;
        sum -= v[i];
    }
    cout << a << " " << b;
    return 0;
}