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

void beolvas(std::istream &be, std::vector<int> &a, int &k) {
    int n;
    be >> n >> k;

    a.resize(n);
    for (auto &e : a) {
        be >> e;
    }
}

void feldolgoz(std::vector<int> &a, int k) {
    const auto n = static_cast<int>(a.size());

    sort(a.begin(), a.end());

    int bal, ossz = 0;
    for (bal = 0; bal < n && ossz <= 0; bal++) {
        ossz += a[bal];
    }

    for (int i = bal; i < n; i++) {
        ossz += a[i];
    }

    int anna = 0;
    if (bal > k) {
        for (int i = n - 1; i >= 0; i -= 2) {
            anna += a[i];
        }

    } else {
        int i;
        for (i = n - 1; i >= k; i -= 2) {
            anna += a[i];
        }

        if (i == k - 1) {
            for (; i >= 0; i--) {
                anna += a[i];
            }
        }
    }

    std::cout << anna << ' ' << ossz - anna << '\n';
}

int main() {
    std::vector<int> a;
    int k;
    beolvas(std::cin, a, k);

    feldolgoz(a, k);

    return 0;
}