Submission #1949492

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;

bool cmp(int x1,int x2){
	return x1>x2;
}

int a[100005],b[100005];

int main(){
	int n,h,ans=0;
	cin >> n >> h;
	for(int i=0;i<n;i++){
		cin >> a[i] >> b[i];
	}
	sort(a,a+n,cmp);
	sort(b,b+n,cmp);
	int l=0,r=0;
	while(h>0){
		if(b[r]>a[l]){
			h -= b[r];
			ans++;
			r++;
		}
		else if(a[l]>=b[r]){
			if(h%a[l]==0){
				ans += h/a[l];
				break;
			}
			else{
				ans += h/a[l];
				ans++;
				break;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result