#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 100010
struct node {
int d,p;
bool operator < (const node& rhs) const {
return d<rhs.d;
}
}a[N],h[N];
int cnt=0;
inline void swap(node& a,node& b) { node t=a; a=b; b=t; }
void put(node x) {
h[++cnt]=x;
for (int son=cnt;son!=1;son>>=1)
if (h[son].p<h[son>>1].p) swap(h[son],h[son>>1]);
else break;
}
void get() {
if (cnt==1) { cnt=0; return; }
h[1]=h[cnt--];
for (int son=2,fat=1;son<=cnt;fat=son,son=fat<<1) {
if (son+1<=cnt && h[son].p>h[son+1].p) son++;
if (h[son].p<h[fat].p) swap(h[son],h[fat]);
else break;
}
}
int main()
{
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d%d",&a[i].d,&a[i].p);
sort(a+1,a+n+1);
for (int i=1;i<=n;i++)
if (cnt==a[i].d)
if (a[i].p>h[1].p) { get(); put(a[i]); }
else;
else put(a[i]);
long long ans=0;
for (int i=1;i<=cnt;i++) ans+=h[i].p;
cout << ans;
//fclose(stdin); fclose(stdout);
return 0;
}