Submission #7027979

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;

int main(){
    int n, h;
    cin >> n >> h;
    vector<int> a(n), b(n);
    rep(i, n) cin >> a[i] >> b[i];

    sort(rall(a));
    sort(rall(b));

    int maxv = a[0];

    int ans = 0;
    rep(i, n){
        if(h < 0 || maxv > b[i]) break;
        h -= b[i];
        ans++;
    }

    if(h > 0) ans += h/maxv + (h%maxv != 0);

    cout << ans << endl;
}

Submission Info

Judge Result