#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, h, maxa = 0, inda = -1, minb = 2000000000, res = 0, tmp;
  cin >> n >> h;
  vector<int> ind, so;
  int a[n], b[n];
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
  for (int i = 0; i < n; i++) {
    if (a[i] > maxa) {
      maxa = a[i];
      ind.clear();
      inda = i;
      ind.push_back(inda);
    } else if (a[i] == maxa) {
      ind.push_back(i);
    }
  }
  for (int i = 0; i < n; i++) {
    bool t = false;
    for (int k = 0; k < ind.size(); k++) {
      if (i == ind[k]) t = true;
    }
    if (t == false) so.push_back(b[i]);
  }
  for (int i = 0; i < ind.size(); i++) {
    if (b[ind[i]] < minb) {
      minb = b[ind[i]];
      inda = ind[i];
    }
  }
  for (int i = 0; i < ind.size(); i++) {
    if (ind[i] != inda) so.push_back(b[ind[i]]);
  }
  sort(so.begin(), so.end());
  tmp = so.size() - 1;
  if (minb >= h || so[tmp] >= h) {
    cout << 1;
    return 0;
  }
  for (int i = so.size() - 1; i >= 0; i--) {
    if (so[i] >= minb) {
      h -= so[i];
      res++;
      if (h <= 0) {
        cout << res;
        return 0;
      }
    } else if (so[i] >= maxa) {
      if (minb < h) {
        h -= so[i];
        res++;
        if (h <= 0) {
          cout << res;
          return 0;
        }
      } else {
        cout << res + 1;
        return 0;
      }
    } else
      break;
  }
  h -= minb;
  if (h <= 0) {
    cout << res + 1;
    return 0;
  }
  if (h % maxa == 0)
    res += h / maxa;
  else
    res += h / maxa + 1;
  cout << res + 1;
  return 0;
  return 0;
}
