#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <climits>
#include <set>
#include <map>
#include <ctime>
#include <functional>
using namespace std;
typedef long long LL;

#ifdef INFOARENA
#define ProblemName "energii"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

#define MAXN 1100
#define MAXW 10010

int dp[MAXW];
int N, tar;
#define cost second
#define energy first

pair<int, int> v[MAXN];

int DP() {
	memset(dp, 0xFF, sizeof(dp));
	dp[0] = 0;
	for (int i = 0; i < N; ++i)
	for (int j = MAXW; j >= 0; --j) {
		if (j < v[i].energy) continue;
		if (dp[j - v[i].energy] < 0) continue;
		int cand = dp[j - v[i].energy] + v[i].cost;
		if (dp[j] < 0 || cand < dp[j])
			dp[j] = cand;
	}
	int best = INT_MAX;
	for (int i = tar; i < MAXW; ++i)
	if (dp[i] >= 0)
		best = min(best, dp[i]);
	return (best == INT_MAX) ? (-1) : best;
}

int main() {
	assert(freopen(InFile, "r", stdin));
	assert(freopen(OuFile, "w", stdout));
	scanf("%d%d", &N, &tar);
	for (int i = 0; i < N; ++i)
		scanf("%d%d", &v[i].energy, &v[i].cost);
	sort(v, v + N);
	printf("%d\n", DP());
	return 0;
}