#include <fstream>
#include <algorithm>
using namespace std;
const int NMAX = 1000, INF = 2e9;
int n, w, c[NMAX + 2], p[NMAX + 2], dp[NMAX + 2][NMAX + 2], i, j;
int main() {
    ifstream cin("energii.in");
    ofstream cout("energii.out");
    cin >> n >> w;
    for(i = 1; i <= n; ++i)
        cin >> p[i] >> c[i];
    for(i = 1; i <= n; ++i)
        for(j = 1; j <= w; j++)
            dp[i][j] = INF;
    for(i = 1; i <= n; ++i) {
        for(j = w; j >= 0; --j) {
            if (j >= p[i]) {
                dp[i][j] = min(dp[i][j], dp[i][j - p[i]] + c[i]);
            }
        }
    }
    if(dp[n][w] == INF)
        cout << "-1\n";
    else
        cout << dp[n][w];
    return 0;
}