#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<ll>;
using ii = pair<ll, ll>;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	ll M;
	cin >> n >> M;

	vector<ii> ab(n);
	for (int i = 0; i < n; ++i)
		cin >> ab[i].first >> ab[i].second;
	sort(ab.begin(), ab.end(), [](const ii &l, const ii &r) {
		return l.second < r.second;
	});

	ll A = ab[0].first, B = ab[0].second;
	ll best = (M + B + A - 1LL) / A;
	for (int i = 1; i < n; ++i)
		A += ab[i].first, B += ab[i].second,
		best = min(best, (M + B + A - 1LL) / A);
		
	cout << best << endl;

	return 0;
}