#include<stdio.h>
#include<algorithm>
using namespace std;
long n,s,i,j,suma;
struct energii
{
	int x,y;
};
energii a[1001];
int cmp(energii a,energii b)
{
	return a.x>b.x;
}
int main()
{
	freopen("energii.in","r",stdin);
	freopen("energii.out","w",stdout);
	scanf("%ld %ld",&n,&s);
	for (i=1;i<=n;i++)
		scanf("%ld %ld",&a[i].x,&a[i].y);
	sort(a+1,a+n+1,cmp);
	for (i=1;i<=n;i++)
		suma+=a[i].x;
	if (suma>=s)
	{
		i=0;
		while (s>0)
		{
			i++;
			s-=a[i].x;
		}
		suma=0;
		for (j=1;j<=i;j++)
			suma+=a[i].y;
		printf("%ld",suma);
	}
	else
		printf("-1");
}