#include<stdio.h>
#include<cstring>
#include<queue>
using namespace std;
struct node
{
int time;
int score;
friend bool operator<(node a,node b)
{
return a.score<b.score;
}
}x;
int main()
{
int i,j,m,n,t;
int vis[2100];
while(scanf("%d",&t)!=EOF)
{
memset(vis,0,sizeof(vis));
priority_queue<node>q;
for(i=0;i<t;i++)
{
scanf("%d%d",&n,&m);
x.time=n;
x.score=m;
q.push(x);
}
int sum=0;
for(i=0;i<n;i++)
{
x=q.top();
for(j=x.time;j>=1;j--)
{
if(vis[j]==0)
{
vis[j]=1;
break;
}
}
if(j==0)
sum+=x.score;
q.pop();
}
printf("sum=%d",sum);
}
return 0;
}