#include <bits/stdc++.h>
using namespace std;
int main()
{
    using ll = long long;
    ll n, h;
    cin >> n >> h;
    using P = pair<ll, ll>;
    vector<P> s(n);
    ll cu = 0;
    for(int i = 0; i < n; i++)
    {
        ll a, b;
        cin >> a >> b;
        s[i].first = b;
        s[i].second = a;
        cu = max(cu, a);
    }
    sort(s.begin(), s.end(), greater<P>());
   
    ll ans = 0;
    for(int i = 0; i < cupos; i++)
    {
        if(cu <= s[i].first)
        {
            h -= s[i].first;
            ans++;
        }
        else
        {
            break;
        }
        if(h <= 0)
        {
            cout << ans << endl;
            return 0;
        }
    }
    while(true)
    {
        if(h <= cu)
        {
            ans++;
            cout << ans << endl;
            return 0;
        }
        else
        {
            h -= cu;
            ans++;
        }
    }
}

