#include <bits/stdc++.h>
using namespace std;
const int N=2.5e4+10;
int n;
long long s[N],c[N],ans;
struct node{int a,b;}x[N];
bool cmp(node u,node v){
	return u.b<v.b;
}
long long calc(){
	for(int i=1;i<=n;i++)s[i]=s[i-1]+x[i].a;
	for(int i=1;i<=n;i++)c[i]=max(c[i-1],s[i])+x[i].b;
	return c[n];
}
int main(){
	freopen("service.in","r",stdin);
	freopen("service.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d %d",&x[i].a,&x[i].b);
	}
	ans=1e15;
	sort(x+1,x+1+n,cmp);
	while(1){
		ans=min(ans,calc());
		random_shuffle(x+1,x+1+n);
		if((double)clock()/CLOCKS_PER_SEC>=0.95){
			printf("%lld",ans);
			return 0;
		}
	}
	return 0;
}