Submission #1949355

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define outl(x) cout << x << endl
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w

#define int long long
//typedef    long long          ll;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      P;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
 
const int INF=1e+12;
const double EPS=1e-9;
const int MOD=1000000007;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

signed main(){
	int n,h,maa = 0,b[100010],cnt = 0,sum = 0;
	cin >> n >> h;
	for(int i = 0;i < n;i++){
		int a;
		cin >> a >> b[i];
		chmax(maa,a);
	}
	sort(b,b + n,greater<int>());
	for(int i = 0;i < n;i++){
		if(b[i] > maa){
			cnt++;
			sum += b[i];
			if(sum >= h){
				cout << cnt << endl;
				return 0;
			}
		}
	}
	cout << cnt + (h - sum + maa - 1) / maa << endl;
	return 0;
}

Submission Info

Judge Result