#include <bits/stdc++.h>
using namespace std;
long long how(long long a, long long b) {
  if (b % a == 0)
    return (b / a);
  else
    return (b / a) + 1;
}
vector<int> a(100005), b(100005);
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, h;
  cin >> n >> h;
  for (int i = 0; i < n; ++i) {
    cin >> a[i] >> b[i];
  }
  sort(a.rbegin(), a.rend());
  sort(b.rbegin(), b.rend());
  for (int i = 1; i < n; ++i) b[i] += b[i - 1];
  long long ans = how(a[0], h);
  for (int i = 0; i < n; ++i) {
    long long k = h - b[i];
    if (k <= 0) break;
    long long p = how(a[0], k) + ((i + 1) * 1LL);
    ans = min(p, ans);
  }
  cout << ans << "\n";
  return 0;
}
