#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n, w, energie[10004], cost[10004], dp[5005];
int main()
{
    f >> n >> w;
    for(int i = 1; i <= n; i++)
        f >> 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]);
    g << dp[w];
    return 0;
}