#include <bits/stdc++.h>
using namespace std;
template <typename P, typename Q>
ostream& operator<<(ostream& os, pair<P, Q> p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
template <typename P, typename Q>
istream& operator>>(istream& is, pair<P, Q>& p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "(";
  for (auto& i : v) os << i << ",";
  os << ")";
  return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& i : v) is >> i;
  return is;
}
template <typename T>
inline T setmax(T& a, T b) {
  return a = std::max(a, b);
}
template <typename T>
inline T setmin(T& a, T b) {
  return a = std::min(a, b);
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int n, hp;
  while (cin >> n >> hp) {
    vector<pair<long long int, long long int>> v(n);
    for (int i = 0; i < n; ++i) {
      cin >> v[i];
    }
    sort(v.begin(), v.end());
    pair<long long int, long long int> p = v.back();
    v.pop_back();
    vector<long long int> u;
    for (auto& i : v) {
      if (p.first < i.second) u.push_back(i.second);
    }
    long long int cnt = 0;
    sort(u.begin(), u.end());
    while (u.size() && (p.second < hp || u.back() <= hp)) {
      hp -= u.back();
      u.pop_back();
      ++cnt;
    }
    if (hp <= 0) {
      cout << cnt << endl;
      continue;
    }
    long long int x = u.size() ? max(p.second, u.back()) : p.second;
    if (hp <= x) {
      cout << cnt + 1 << endl;
      continue;
    }
    long long int y = (hp - p.second) / p.first;
    cnt += y;
    hp -= y * p.first;
    for (long long int i = 0; i < 100; ++i) {
      long long int z = hp - (p.first * i) - p.second;
      if (z <= 0) {
        cnt += i + 1;
        break;
      }
    }
    cout << cnt << endl;
  }
  return 0;
}
