#include <stdio.h>
#include <string.h>

#define SENTINEL 1000000000

int count = 0;

void mergeSort(int A[],int left,int right){
  int i,mid;
  if(left+1<right){
    mid=(left+right)/2;
    mergeSort(A,left,mid);
    mergeSort(A,mid,right);
    merge(A,left,mid,right);
  }
}



void merge(int A[],int left,int mid,int right){
  int n1,n2,i,j,k;
  int *L,*R;
  n1=mid-left;
  n2=right-mid;
  L=(int *)malloc(sizeof(int)*(n1+1));
  R=(int *)malloc(sizeof(int)*(n2+1));
  for(i=0;i<=n1-1;i++){
    L[i]=A[left+i];
  }
  for(j=0;j<=n2-1;j++){
    R[j]=A[mid+j];
  }
  L[n1]=SENTINEL;
  R[n2]=SENTINEL;
  i=0;
  j=0;
  for(k=left;k<=right-1;k++){
   if(L[i]<=R[j]){
      A[k]=L[i];
      i++;
      count++;
    }
    else{
      A[k]=R[j];
      j++;
      count++;
    }
  }
  free(L);
  free(R);
}

int main(){
  int n,h,i,j,s,ans=0,ruiseki=0,tmp,max=0;
  scanf("%d %d",&n,&h);
  int a[n],b[n];
  for(i=0;i<=n-1;i++){
    scanf("%d %d",&a[i],&b[i]);
  }
  for(i=0;i<=n-1;i++){
    if(max <= a[i]){
      max = a[i];
    }
  }
  mergeSort(B,0,n-1)
  for(i=0;i<n;i++){
    if(max < b[i]){
      ruiseki += b[i];
      ans += 1;
      if(ruiseki >= h){
        break;
      }
    }else{
      break;
    }
  }
  if(ruiseki < h){
    s = h-ruiseki;
    if(s%max == 0){
      ans += s/max;
    }else{
      ans += s/max + 1;
    }
  }
  printf("%d",ans);
  return 0;
}
  
  