#include <bits/stdc++.h>
using namespace std;
class UnionFind {
 public:
  vector<int> par;
  vector<int> rank;
  UnionFind(int n) {
    for (long long i = 0; i < n; i++) {
      par.push_back(i);
      rank.push_back(0);
    }
  }
  int find(int x) {
    if (par[x] == x) {
      return x;
    } else {
      return par[x] = find(par[x]);
    }
  }
  void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    if (rank[x] < rank[y]) {
      par[x] = y;
    } else {
      par[y] = x;
      if (rank[x] == rank[y]) rank[x]++;
    }
  }
  bool same(int x, int y) { return find(x) == find(y); }
};
template <class T>
int former(const vector<T> &v, T x) {
  return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T>
int latter(const vector<T> &v, T x) {
  return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <class T>
void cout_vec(const vector<T> &vec1) {
  for (long long i = 0; i < long long(vec1.size()); i++) {
    cout << vec1[i] << ' ';
  }
  cout << '\n';
}
template <class T>
T comb(T n, T k) {
  T ans = 1;
  for (long long i = n - k + 1; i < n + 1; i++) {
    ans *= i;
  }
  for (long long i = 1; i < k + 1; i++) {
    ans /= i;
  }
  return ans;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <class T>
map<T, T> prime_factor(T x) {
  map<T, T> ans;
  for (T i = 2; i * i <= x; i++) {
    while (x % i == 0) {
      x /= i;
      ans[i]++;
    }
  }
  if (x != 1) {
    ans[x] = 1;
  }
  return ans;
}
template <class T>
vector<T> divisor(T x) {
  vector<T> res;
  for (T i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      res.push_back(i);
      if (i != x / i) {
        res.push_back(x / i);
      }
    }
  }
  return res;
}
template <class T>
bool is_prime(T x) {
  for (T i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      return false;
    }
  }
  return x != 1;
}
const long long inf = 1e9 + 7;
long long mult(long long n, long long m) {
  if (m == 1) {
    return n % inf;
  } else if (m % 2 == 0) {
    long long t = mult(n, m / 2);
    return (t * t) % inf;
  } else {
    long long t = mult(n, m - 1);
    return (t * n) % inf;
  }
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n, h;
  cin >> n >> h;
  vector<pair<long long, long long> > at(n);
  pair<long long, long long> ma = pair<long long, long long>(0, 0);
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    if (ma.second < a || (ma.second == a && ma.first > b)) {
      ma = pair<long long, long long>(b, a);
    }
    at[i] = pair<long long, long long>(b, a);
  }
  long long cnt = count(begin(at), end(at), ma);
  sort(begin(at), end(at), greater<pair<long long, long long> >());
  for (long long i = 0; i < n; i++) {
    if (at[i] != ma && at[i].first > ma.second) {
      h -= at[i].first;
      ans++;
      if (h <= 0) {
        cout << ans << endl;
        return 0;
      }
    } else {
      break;
    }
  }
  while (cnt > 1 && ma.first > ma.second) {
    h -= ma.first;
    ans++;
    cnt--;
  }
  while (h > 0) {
    if (h - ma.first <= 0) {
      h -= ma.first;
      ans++;
    } else {
      h -= ma.second;
      ans++;
    }
  }
  cout << ans << endl;
}
