f[0][0]=0;

cin>>n>>h;

for (int i=1; i<=n; i++) {
	cin>>w[i]>>v[i];
}

for (int i=1; i<=n; i++) {
	for (int j=0; j<=h; j++) {
		if (j<w[i]) {
			f[i][j]=min(f[i-1][j],v[i]);
		}
		else {
			f[i][j]=min(f[i-1][j],f[i][j-w[i]]+v[i]);
		}
	}
}

cout<<f[n][h];

return 0;

}