#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int n,m,i,b[10000],w[10000],sw,sb;
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++){
        f>>b[i]>>w[i];
    }
    sort(b+1,b+n+1);
    sort(w+1,w+n+1);
    for(i=n;i>n/2;i--){
        sb+=b[i];
        sw+=w[i];
    }

    g<<sb<<" "<<sw;
    return 0;
}