#include <bits/stdc++.h>
using namespace std;
long long a[100005], b[100005], sumb[100005] = {0};
int main() {
  long long n, y;
  scanf("%lld%lld", &n, &y);
  for (int i = 1; i <= n; i++) {
    scanf("%lld%lld", &a[i], &b[i]);
    sumb[i] = sumb[i - 1] + b[i];
  }
  sort(a + 1, a + 1 + n);
  sort(b + 1, b + 1 + n);
  long long mid = a[n];
  long long k = lower_bound(b + 1, b + 1 + n, mid) - b;
  y = y - (sumb[n] - sumb[k - 1]);
  long long num = n - k + 1;
  int num1 = y / mid;
  if (num1 * mid < y) num1++;
  num += num1;
  printf("%lld\n", num);
}
