#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

struct box
{
  int w,b;
};

bool cmp(box x, box y)
{
    return (x.b < y.b);
}

int main()
{
    int n, m,s1=0,s2=0;

    vector<box> A;

    cin >> n >> m;

    A.resize(n+1);

    for(int i=1; i<=n; i++)
        cin >> A[i].w >> A[i].b;

    sort(A.begin(), A.end(), cmp);

    for(int i=1; i<=n; i++)
    {
        if (i<=n/2) s2+=A[i].w;
               else s1+=A[i].b;
    }

    cout << s1 << " " << s2;


    return 0;
}