#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

struct data{
    int V,T;
};

bool dp[10011];

int main()
{
    int N;
    cin>>N;
    vector<data> dat(N);
    FOR(i,N) scanf("%d%d",&dat[i].V,&dat[i].T);
    sort(ALL(dat),[](const data&d1, const data&d2){
            int take1 = (d1.V) <= d2.T;
            int take2 = (d2.V) <= d1.T;
            if(take1 == take2){
                return d1.T < d2.T;
            }else if(take1){ 
                return true;
            }else return false;
        });
    memset(dp , 0 , sizeof(dp));
    dp[0] = true;
    for(const auto& d : dat){
        for(int i=d.T-1;i>=0;i--){
            dp[i+d.V] |= dp[i] ;
        }
    }
    int ans = 0;
    for(int i=10000;i>=0;i--){
        if(dp[i]){ ans=i; break; }
    }
    cout<<ans<<endl;
    return 0;
}