#include <iostream>
#include <algorithm>

using namespace std;

const int NMAX = 100005 ; 

struct SZAMOK {
int x, y ; 
} A[NMAX] ; 

long long N, NR, S1, S2, M ; 

bool compare(SZAMOK a, SZAMOK b)
{
	return a.x > b.x ; 
}


int main() {
	
	cin >> N  >> M ;
	
	
	for(int i = 1 ; i <= N ; ++ i)
	{
		cin >> A[i].x >> A[i].y ; 
	}
	
	
	sort(A + 1, A + N + 1, compare) ; 
	
	
	for(int i = 1 ; i <= N / 2 ; ++ i)
	S1 = S1 + A[i].x ;
	
	for(int i = (N / 2 )+ 1 ; i <= N ; ++ i)
	S2 = S2 + A[i].y ; 
	
	
	cout <<  S2 << ' ' << S1 << '\n' ; 
	
	
	
	return 0;
}