PYRAMID

#include <iostream>
#include <algorithm>

using namespace std;
long long n;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    long long *first = new long long[n];
    long long *second = new long long[n];
    long long *least = new long long[n];
    for (long long i = 0; i < n; ++i)
    {
        cin >> first[i] >> second[i];
        least[i] = min(first[i], second[i]);
    }
    sort(least, least + n);
    long long answer = 0;
    long long length = 0;   // minimum dimension required for certain height
    long long j = 0;    // to iterate between sorted least dimensions
    while (j < n)
    {
        if (length <= least[j])
        {
            answer = length;
            ++length;
            ++j;
        }
        else
        {
            ++j;
        }
    }
    cout << answer;
    return 0;
}