Submission #3426600

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;
#define pri(a) cout << (a) << endl


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll N , H;
	cin >> N >> H;
	priority_queue<P> Q;
	FOR(i,0,N){
		ll a,b;
		cin >> a >> b;
		Q.push({a,1});
		Q.push({b,0});
	}
	ll ans = 0;
	while(H>0){
		ans++;
		P x = Q.top();
		if(x.second==0)Q.pop();
		if(x.second==0){
			H -= x.first;
		}else{
			ll k = H / x.first;
			ans += k-1;
			H -= k*x.first;
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result