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

bool myfunction (pair<int,int> i , pair<int,int> j) { return (i.first<j.first); }

int main()
{
	int N, M, wi, bi, sumw = 0, sumb = 0;
	std::vector< pair<int,int> > bile;
	cin >> N >> M;
	for(int i = 0; i < N; i++)
	{
		cin >> wi >> bi;
		bile.push_back(make_pair(wi,bi));
	}
	std::sort(bile.begin(), bile.end(), myfunction);
	for(int i = 0; i < N/2; i++)
			sumw += bile[i].second;
	for (int i = N/2; i < N; i++)
			sumb += bile[i].first;
	cout << sumw << " " << sumb;
	return 0;
}