#include <stdio.h>
#include <stdlib.h>

int w[100000],b[100000];

void quick_sort(int left,int right)
{
    int i,j,pivot;
    i=left;
    j=right;
    pivot=w[(i+j)/2];
    while (i<=j)
    {
        while (w[i]<pivot)
        {
            i++;
        }
        while (w[j]>pivot)
        {
            j--;
        }
        if (i<=j)
        {
            int temp;
            temp=w[i];
            w[i]=w[j];
            w[j]=temp;
            temp=b[i];
            b[i]=b[j];
            b[j]=temp;
            i++;
            j--;
        }
    }
    if (left<j)
    {
        quick_sort(left,j);
    }
    if (i<right)
    {
        quick_sort(i,right);
    }
}

int main()
{
    long int n,m;
    scanf("%d %d",&n,&m);
    int i;
    for (i=0;i<n;i++)
    {
        scanf("%d %d",&w[i],&b[i]);
    }
    quick_sort(0,n-1);
    int nrw=0,nrb=0;
    for (i=0;i<n;i++)
    {
        if (i<n/2)
        {
            nrb+=b[i];
        }
        else
        {
            nrw+=w[i];
        }
    }
    printf("%d %d",nrb,nrw);
    return 0;
}