#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2
const int MAXN=2e3+5;
const int INF=1e18;
vii tut[MAXN];
bool used[MAXN];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
vii a(n+1);
FORE(i,1,n+1){
cin>>a[i].fi>>a[i].se;
tut[a[i].se].pb({a[i].fi,i});
}
priority_queue<pii> pq;
int curt=n;
pii ans;
ans.fi=0;
ans.se=0;
while(curt){
for(auto el:tut[curt]){
pq.push({-el.fi,el.se});
}
if(!pq.empty()){
ans.fi++;
ans.se+=pq.top().fi*-1;
pq.pop();
}
curt--;
}
cout<<ans.fi sp ans.se<<endl;
}
