#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x,0
#define rcc(s) cout<<s,exit(0)
#define forn(i,n) for(int i=0;i<int(n);i++)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;
typedef long double ld;

const int nmax=1e4+3;
const int mod=998244353;
const ll inf=2e9+3;

using namespace std;

int dp[10003];

int main()
{
  freopen("energii.in","r",stdin);
  freopen("energii.out","w",stdout);
  //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
  int n,k;
  cin>>n>>k;
  int a[n+3],b[n+3],sol=inf;
  for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
  dp[0]=1;
  for(int i=1;i<=n;i++)
  for(int j=nmax-a[i];j>=0;j--)
  if(dp[j])
  {
    if(!j || dp[j]) dp[j+a[i]]+=dp[j]+b[i]-(!j);
    if(j+a[i]>=k)
    {
      sol=min(sol,dp[j+a[i]]);
    }
  }
  cout<<sol;
}