#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <climits>
#include <bitset>
#define All(x) begin(x),end(x)
#define ll long long int
#define debug(x) cerr<<#x<<" = "<<(x)<<endl
#define _ ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

int main() {_
    int n;
    while (cin >> n && n) {  // 迴圈到n不為0
        vector<pair<int, int>> arr;
        for (int i=0; i<n; ++i) {
            int c,e;
            cin >> c >> e;
            arr.push_back(make_pair(e, c));
        }
        sort(arr.begin(), arr.end(), greater<pair<int, int>>());  // pair 的 greater 會先比較第一項大小再比較第二項
        
        ll curTime = 0; // 廚師煮飯到現在的時間
        ll maxTime = 0;
        for (int i=0; i<n; ++i) {
            curTime = curTime + arr[i].second; 
            maxTime = max(maxTime, curTime + arr[i].first); // curTime + arr[i].first是第i人離開的時間
        }
        cout << maxTime << endl;
    }
    return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#define ll long long
#define _ ios::sync_with_stdio(false);cin.tie(0);
using namespace std;

signed main() {_
    ll n;
    while (cin>>n) {
        priority_queue<ll, vector<ll>, greater<ll> > pq;
        for (ll i=0; i<n; i++) {
            ll temp;
            cin>>temp;
            pq.push(temp);
        }
        ll sum=0;
        ll a,b;
        while (pq.size() > 1) {
            a = pq.top();
            pq.pop();
            b = pq.top();
            pq.pop();
            sum += a+b;
            pq.push(a+b);
        }
        cout << sum << endl;
        
    }    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define AI(x) begin(x),end(x)
#define ll long long
#define endl '\n'
#define _ ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

signed main() {_
    int n;
    cin >> n;
    vector<int> arr(n);
    for (auto &i : arr) cin >> i;
    sort(AI(arr));
    ll ans = 0;
    for (int i = 0; i < n/2; ++i) {
        ans += arr[i];
    }
    cout << ans << endl;
    return 0;
}

int binery_search(int l, int r) {
    while (r - l > 1) {  // 注意！
        int mid = (l + r) / 2;  // 求中點
        if (check(mid) == 1) {
            r = mid;     // 注意！
        } else {
            l = mid;     // 注意！
        }
    }
    return l;
}

#include <iostream>
#include "lib1044.h"
#define ll long long int
#define _ ios::sync_with_stdio(false);cin.tie(0);
using namespace std;

int main() {_
    int n = Initialize();
    int l = 1; int r = n;
    int mid = (l+r)/2;
    while (l < r) {
        mid = (l+r)/2;
        if (Guess(mid)){
            r = mid;
        }else{
            l = mid + 1;
        }
    }
    Report(l);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

const int SIZE = 2e5 + 5;
const int KSIZ = 5005;
const int INF = 1e9;

int n, k;
int h[SIZE], w[KSIZ];

bool check (int x) {
    int pos = 1, len = 0;
    for (int i = 1; i <= n; i++) {
        if (h[i] >= x) len++;
        else len = 0;
        if (len == w[pos]) {
            pos++;
            len = 0;
        }
        if (pos > k) return 1;
    }
    return 0;
}

int main() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> h[i];
    for (int i = 1; i <= k; i++) cin >> w[i];
    int maxheight = 0;
    for (int &i : h) maxheight = max(maxheight, i);
    
    for (int i = maxheight; i >= 0; i--) {  // 窮舉每個高度
        if (check(i)) {               // 檢查能不能貼海報
            cout << i << endl;
            break;
        }
    }
}

#include <bits/stdc++.h>
using namespace std;

const int SIZE = 2e5 + 5;
const int KSIZ = 5005;
const int INF = 1e9+5;

int n, k;
int h[SIZE], w[KSIZ];

bool ok (int x) {
    int pos = 1, len = 0;
    for (int i = 1; i <= n; i++) {
        if (h[i] >= x) len++;
        else len = 0;
        if (len == w[pos]) {
            pos++;
            len = 0;
        }
        if (pos > k) return 1;
    }
    return 0;
}

int main() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> h[i];
    for (int i = 1; i <= k; i++) cin >> w[i];

    int l = 1, r = INF;
    while (l < r) {
        int mid = (l + r) / 2;
        if (!ok (mid)) r = mid;
        else l = mid + 1;
    }
    cout << l - 1 << '\n';
}

bool is_legal(int r){
  int cover = 0; // 最右側覆蓋位置
  int stand = 0; // 用了幾個基地台
  for(int i=0; i<n; i++){
    if(arr[i] > cover){
      cover = arr[i] + r;			
      stand++;
    }
  } 
  if(stand > k) return false; // 基地台數量不符合
  else return true;
}

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl '\n'
#define AI(x) begin(x),end(x)
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int arr[50005];
int n, k;

bool is_legal(int r){
  int cover = 0; // 最右側覆蓋位置
  int stand = 0; // 用了幾個基地台
  for(int i=0; i<n; i++){
    if(arr[i] > cover){
      cover = arr[i] + r;			
      stand++;
    }
  } 
  if(stand > k) return false; // 基地台數量不符合
  else return true;
}

signed main(){_
	cin >> n >> k;
	for (int i = 0; i < n; ++i) {
		cin >> arr[i];
	}
	sort(arr, arr+n);
	int l = 0, r = 1e9+5;
	while (l < r) {   // 左閉右閉 維護1區間
		int mid = l + (r - l) / 2;
		if (is_legal(mid)) {
			r = mid;
		} else {
			l = mid + 1;
		}
	}
	cout << l << endl;

	return 0;
}