from operator import itemgetter from itertools import * from bisect import * from collections import * from heapq import * import sys sys.setrecursionlimit(10**6) def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def SI(): return sys.stdin.readline()[:-1] def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] int1 = lambda x: int(x)-1 def MI1(): return map(int1, sys.stdin.readline().split()) def LI1(): return list(map(int1, sys.stdin.readline().split())) p2D = lambda x: print(*x, sep="\n") dij = [(1, 0), (0, 1), (-1, 0), (0, -1)] import numpy as np n=II() inf=100005 mx=50005 dp=np.full(mx,inf,dtype="i8") dp[0]=0 for _ in range(n): a,b=MI() ndp=dp+b ndp[a:]=np.minimum(ndp[a:],dp[:mx-a]) dp=ndp # print(dp) print(np.min(np.maximum(dp,np.arange(mx))))