#include <fstream>
#include <algorithm>
#define MAX 1001
using namespace std;

ifstream fin("energii.in");
ofstream fout("energii.out");

int V[MAX][MAX];
int C[MAX], P[MAX];
int main()
{
    int n, g;

    fin >> n >> g;

    for(int i = 1; i <= n;i++)
    {
        fin >> P[i] >> C[i];
    }
    fin.close();
    for(int i = 0; i <= g; i++)
    {
        V[0][i] = C[1];
    }
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= g; j++)
        {
            if(P[i] >= j)
            {
                V[i][j] = min(C[i], V[i-1][j]);
            }
            else
            {
                V[i][j] = C[i] + V[i-1][j-C[j]];
            }
        }
    }
    fout << V[n][g];
    fout.close();

    return 0;
}