#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long max3 = 1003;
const long long max4 = 10004;
const long long maxx = 100005;
const long long max6 = 1000006;
const long long max7 = 10000007;
const long long lg4 = 13;
const long long lg5 = 17;
const long long lg6 = 20;
const long long INF = 2LL * 1000000000;
const long long INFLL = 9LL * 1000000000 * 1000000000;
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
  }
  return res;
}
long long gcd(long long a, long long b) {
  while (b > 0) {
    long long t = a % b;
    a = b, b = t;
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
long long is_prime(long long n) {
  if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0)) return 0;
  for (long long i = 5, t = 2; i * i <= n; i += t, t = 6 - t)
    if (n % i == 0) return 0;
  return 1;
}
long long arr[maxx], brr[maxx];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  ;
  long long n, h;
  cin >> n >> h;
  for (long long i = 1; i <= n; i++) {
    cin >> arr[i] >> brr[i];
  }
  sort(arr + 1, arr + n + 1);
  sort(brr + 1, brr + n + 1);
  long long cur = 0, res = INFLL;
  for (long long i = n; i >= 1; i--) {
    res =
        min(res, max(1LL, (n - i) + (long long)ceil(1.0 * (h - cur) / arr[n])));
    cur += brr[i];
  }
  res = min(res, max(1LL, (n - 0) + (long long)ceil(1.0 * (h - cur) / arr[n])));
  cout << res << '\n';
  return 0;
}
