感觉和题解差不多，但是只有50分

#include <bits/stdc++.h>
using namespace std;
int n,i,x,t,ans;
long long f[10000005];
inline int read()
{
	int x=0;
	bool flag=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')
			flag=0;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<1)+(x<<3)+c-'0';
		c=getchar();
	}
	return (flag?x:~(x-1));
}
int main(){
    n=read();
    for(i=1;i<=n;i++)
    {
    	x=read();
    	t=read();
    	if(t>1&&f[x]==0)
    	{
    		ans+=t;
    		f[x]=1;
		}
	}
	cout<<ans<<endl;
    return 0;
}