#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

#define ll long long

using namespace std;

const int N=,M=;

int n,lm,v[N],c[N],l,r,mid,ans;

ll a[N],dp[M];

bool check()

{

    for(int i=;i<=n;i++)

        a[i]=c[i]-(ll)mid*v[i];

    memset(dp,-,sizeof dp);

    dp[]=;

    for(int i=;i<=n;i++)

        for(int j=lm;j>=;j--)

            dp[min(lm,j+v[i])]=

                max(dp[min(lm,j+v[i])],dp[j]+a[i]);

    return dp[lm]>=;

}

int main()

{

    scanf("%d%d",&n,&lm);

    for(int i=;i<=n;i++)

    {

        scanf("%d%d",&v[i],&c[i]);

        c[i]*=;  r+=c[i];

    }

    while(l<=r)

    {

        mid=l+r>>;

        if(check())ans=mid,l=mid+;

        else r=mid-;

    }

    printf("%d\n",ans);

    return ;

}