Submission #5706481

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll,ll> > Q;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const ll inf=1e9+7;
ll gcd(ll a, ll b) { return (b ? gcd(b, a % b) : a); }
ll lcm(ll a, ll b) { return a / (gcd(a, b)) * b; }

int n,h;
int main(){
  cin>>n>>h;
  vector<pair<ll,ll> > a(n);
  priority_queue<ll> que;
  rep(i,n){
    cin>>a[i].first>>a[i].second;
    que.push(a[i].second);
  }

  sort(a.begin(),a.end());
  ll tmp=a[n-1].first,cnt=0;
    while(h>0 && !que.empty()){
      if(que.top()>tmp){
        h-=que.top();
        que.pop();
        cnt++;
      }
      else break;
    }

  if(h>0){
      if(h%tmp) cnt+=(h/tmp)+1;
      else cnt+=h/tmp;
  }

  cout<<cnt<<endl;

}

Submission Info

Judge Result