//#include <iostream>
#include <limits.h>
#include <fstream>
using namespace std;
const int NMAX = 5e4 + 1;
ifstream cin("energii.in");
ofstream cout("energii.out");
int n, W, dp[NMAX], w[NMAX], c[NMAX], minim = INT_MAX;
int main()
{
    cin >> n >> W;
    for (int i = 1; i <= n; i++)
    {
        cin >> w[i] >> c[i];
    }
    for (int i = 1; i <= W; i++)
    {
        dp[i] = INT_MAX;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int g = W; g >=  0; g--)
        {
            //ordinea inversa aduce NESUPRAPUNERE
            if (dp[g] != INT_MAX)
            {
                if (g + w[i] >= W)
                {
                    minim = min(minim, dp[g] + c[i]);
                }
                else
                {
                    dp[g + w[i]] = min(dp[g + w[i]], dp[g] + c[i]);
                }
            }
        }
    }
    if (minim == INT_MAX)
    {
        cout << -1;
    }
    else
    {
        cout << minim;
    }
}