#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
int A[100001], B[100001];

bool cmp(const int &a, const int &b)
{
    return a > b;
}

int main()
{
    cin >> n >> m;
    for( int i = 1; i <= n; ++i )
        cin >> A[i] >> B[i];
    sort(A + 1, A + 1 + n, cmp);
    sort(B + 1, B + 1 + n, cmp);
    int ans1 = 0, ans2 = 0;
    for( int i = 1; i <= n / 2; ++i )
        ans1 += A[i], ans2 += B[i];
    cout << ans2 << ' ' << ans1;
    return 0;
}