#include <iostream>
#include <fstream>
#include <climits>

using namespace std;

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

const int MAXN = 10004;
int n, w, energie[MAXN], cost[MAXN], dp[5005];

int main()
{
    fin >> n >> w;
    for(int i = 1; i <= n; i++)
        fin >> energie[i] >> cost[i];
    for(int i = 0; i <= 2*w; i++) dp[i] = INT_MAX-1000;
    for(int i = 1; i <= n; i++)
        for(int j = w; j; j--)
            if(j <= energie[i]) dp[j] = min(dp[j], cost[i]);
            else dp[j] = min(dp[j], dp[j-energie[i]] + cost[i]);
    fout << dp[w];
    return 0;
}