Submission #1951083

---

Source Code Expand

#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
using namespace std;

typedef long long ll;
int n;
ll a[10005],b[10005];
ll H;

int main(){
	cin>>n>>H;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
	}
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	ll ans=0;
	for(int i=1;i<=n;i++){
		if(b[i]>a[n]){
			H-=b[i];
			ans++;
		}
	}
	while(H>0){
		H-=a[n];
		ans++;
	}
//	cout<<H<<endl;
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result