#include <bits/stdc++.h>
using namespace std;
template <class T>
void chmin(T& a, T const& b) {
  if (b < a) a = b;
}
using ll = long long;
const ll mod = LLONG_MAX;
int N, H;
pair<int, int> a[10010];
pair<int, int> c[10010];
int main() {
  cin >> N >> H;
  int temp = -1e9;
  for (int i = 0; i < N; i++) {
    cin >> a[i].second >> a[i].first;
    if (temp < a[i].second) temp = a[i].second;
    c[i].first = a[i].second;
    c[i].second = i;
  }
  sort(c, c + N);
  reverse(c, c + N);
  sort(a, a + N);
  reverse(a, a + N);
  int idx = 0;
  while (1) {
    if (H < 0 || idx == N || temp > a[idx].first) break;
    H -= a[idx].first;
    idx++;
  }
  if (H <= 0)
    cout << idx << endl;
  else
    cout << idx + ((H - 1) / c[0].first) + 1 << endl;
}
