#include using namespace std; #define rep(i,n) for(int (i) = 0 ; (i) < (int)(n) ; (i)++) #define REP(i,a,b) for(int (i) = a ; (int)(i) <= (int)(b) ; (i)++) #define all(n) (n).begin(),(n).end() typedef long long ll; typedef vector Vi; typedef vector VVi; typedef pair Pii; typedef vector VPii; bool dp[20010]; int main(){ int N; cin >> N; vector< pair > v; for(int i = 0 ; i < N ; i++){ int V,T; cin >> V >> T; v.push_back({T+V,V}); } sort(v.begin(),v.end()); dp[0] = 1; for(auto i : v ){ int V = i.second; int T = i.first - V; for(int j = T - 1 ; j >= 0 ; j--) dp[j+V] |= dp[j]; } for(int i = 20000 ; i >= 0 ; i--) if( dp[i] ){ cout << i << endl; return 0; } }