#include <iostream>
#include <algorithm>

using namespace std;
struct bile{int x,y;} a[100005];
int n,m,i,albe,negre;
bool comp(bile a,bile b)
{
    return a.x>b.x;
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        cin>>a[i].x>>a[i].y;
    }
    sort(a+1,a+n+1,comp);
    for(i=1;i<=n/2;i++)
    {
        albe+=a[i].x;
    }
    for(;i<=n;i++)
    {
        negre+=a[i].y;
    }
    cout<<negre<<" "<<albe;
    return 0;
}