Submission #1949353

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define MAX 1000005
using namespace std;
ll n, m, i ,j ,k ,l, ans, tmp, res, tmp2;
ll arr[MAX], brr[MAX];
vector<ll> v;
string s;
map<ll,ll> mp;
int main()
{
	
		cin>>n>>m;
		for(i=0;i<n;i++)
			cin>>arr[i]>>brr[i];
		sort(arr,arr+n);
		sort(brr,brr+n);
		for(i=n-1;i>=0;i--)
		{
			if(brr[i]<=arr[n-1])break;
			ans+=brr[i];
			if(ans>=m)
			{
				cout<<n-i;
				return 0;
			}
		}
		i++;
		cout<<(n-i) + (m-ans+arr[n-1]-1)/arr[n-1];


return 0;
}
 

Submission Info

Judge Result