Submission #1947979

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int64 LINF = 1LL << 61;
const int INF = 1 << 30;

int main()
{
  int N, H;
  cin >> N >> H;
  // 多分 a_i が最大の刀だけ振りそう
  vector< int > mp(N);
  int mx = 0;
  for(auto &p : mp) {
    int a;
    cin >> a >> p;
    mx = max(mx, a);
  }
  sort(begin(mp), end(mp));

  int64 sum = 0;
  int64 ret = LINF;
  for(int i = N; i >= 0; i--) {
    if(i != N) sum += mp[i];
    ret = min(ret, (N - i) + (max(0LL, H - sum) + mx - 1) / mx);
  }

  cout << ret << endl;
}

Submission Info

Judge Result